Equivalent Regular Expressions

Q1. Show that the following pairs of regular expressions define the same language over the
alphabet

L = {a, b}.

(i) (ab)*a and a(ba)*

(ii) (a* + b)* and (a + b)*
(iii) (a* + b*)* and (a + b)*

Ans:

(i) (ab)*a and a(ba)*

The language defined by the expression (ab)*a

In this expression set of all strings have at least “a” as string.
Languag 1
(ab)*={^,ab,abab,ababab,….}

(ab)*a={a,aba,ababa,abababa,….}

The language defined by the expression a(ba)*

In this expression set of all strings have at least “a” as string.
Language 2
(ba)*= {^,ba,baba,bababa,….}
a(ba)*={a,aba,abababa,….}

Language 1 = Language 2

Hence proved that both regular expression define the same languages.

(ii) (a* + b)* and (a + b)*

The language defined by the expression (a* + b)*

In this expression set of all strings have at least “a” as string because of a*.
Language 1
(a* + b)*={^,a,b,ab,aab,abb,aaab}

The language defined by the expression (a + b)*

In this expression set of all strings have at least “a” as string.
Language 2
(a + b)*={^,a,b,ab,aab,abb,aaab}
(Note: There may be more possibilities for string value for language 2 but we write
those string values that are matched with language 1)

Language 1 = Language 2
Hence proved that both regular expression define the same languages.