910 views
1 votes
1 votes

1 Answer

0 votes
0 votes

All the given regular expression are of form (0+1)*.

So L(r1)=L(r2)=L(r3)

NOTE:(0+1)*=(0*+1)*=(0+1*)*=(0*+1*)*=(0*1*)*=(1*0*)*=0*(10*)*=1*(01*)*

edited by

Related questions

0 votes
0 votes
1 answer
1
M_Umair_Khan42900 asked Dec 29, 2022
787 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
0 answers
2
sripo asked Oct 10, 2018
668 views
For $\sum$={a,b} Re given is b*ab*(aa)*b* this is non minimized dfa but when the dfa is minimized we get RE as b*a(a+b)*. How to show that are they equivalent or is it ju...
0 votes
0 votes
1 answer
3
goluabhinan asked Sep 11, 2018
814 views
Consider the regular expression R = a*b* + b*a*. The number of equivalence classes of Σ* to represent a language which is equivalent to R is ____________.
0 votes
0 votes
2 answers
4