Question: For show that the following pairs of regular expressions define the same language over the alphabet = {a b} : (i) (ab)*a and a(ba)*

For show that the following pairs of regular expressions define the same language over the alphabet Σ = {a b} :

(i) (ab)*a and a(ba)*
(ii) (a* + b)* and (a + b)*
(iii) (a* + b*)* and (a + b)*

Step by Step Solution

3.36 Rating (168 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

i abac and abac ii a bc and a bc iii a bd and a bd where the first term is the regula... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related SQL Database Programming Questions!