Register

Proof (a* b*)* = (a + b)*

13,422 views
2 2 votes

(a*b*)* = (a + b)*
I always used this while solving questions. It seems correct also because when ever I pick a random string over {a, b} then I found that it can be generated from (a*b*)*. But I don't have any formal proof for this.

Someone, please proof this.

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · computer Network gat...Next → · Cn: Optimal windows ...
← Previous in category · NPTELNext in category → · How these languages ...
Position:
Show:

Related questions

4 4 votes
1 answers 1 answer
1.6k
1.6k views
Bhagirathi asked Oct 4, 2014
1,586 views
Toc theorem proof
How $\phi^*=\epsilon$?
0 0 votes
1 1 answer
1.3k
1.3k views
M_Umair_Khan42900 asked Dec 29, 2022
1,261 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)* and ((1*0)*01*)* (c) (s*ttt)*s* and s*(ttts*)*
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)...
1 1 vote
1 1 answer
3.3k
3.3k views
M_Umair_Khan42900 asked Dec 29, 2022
3,250 views
Write regular expression to denote a language L a) String which begin or end with either 00 or 11. b) The set of all strings, when viewed as binary representation of integers, that are divisible by 2. c) The set of all strings containing 00. d) String not containing the substring 110.
Write regular expression to denote a language La) String which begin or end with either 00 or 11.b) The set of all strings, when viewed as binary representation of intege...
0 0 votes
1 1 answer
1.3k
1.3k views
Hemant jha asked Dec 25, 2022
1,322 views
find all strings of lenght 4 less, for the following regular expression (a*b + b*a)