563 views

2 Answers

2 votes
2 votes
For (ab* + b)*, the language it represents is (a, b, ab, ba, aa, ab, aab,.....)  i.e. all strings consisting of a and b.

And for (a + b)*, the language it represents is also (a, b, ab, ba, aa, ab, ...) i.e. again all strings consisting of a and b. Since both the regular expressions represent the same language, they are equivalent.

Related questions

0 votes
0 votes
1 answer
2
M_Umair_Khan42900 asked Dec 29, 2022
781 views
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b].s(a) p(pp)*( A + p)q + q and p*q(b) A +0(0+1)* + (0+1)* 00(0+1)...
0 votes
0 votes
1 answer
3
Abhipsa asked Jan 21, 2019
883 views
Why this is not equal?(r+s)*=r*+s*