Register

regular expressions

805 views
3 votes
3 votes

Answer is c. but i think it should be b as 

r1 = (0+1)* = r2=r3. please correct me if i m wrong

User Avatar

2 Answers

0 votes
0 votes
One thing you should know that when comparing regex it's very tricky to deduce that the regex are equal or not unless they are reduced using identity so I recommend you to not fall prey to the bait but instead make an automata for each of the regex and then compare you will be able to compare regex quite remarkably
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

820
views
1 answers
0 votes
M_Umair_Khan42900 asked Dec 29, 2022
820 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)...
User Avatar
688
views
0 answers
0 votes
sripo asked Oct 10, 2018
688 views
Equivalence of regular expressions
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...
User Avatar
849
views
1 answers
0 votes
goluabhinan asked Sep 11, 2018
849 views
Doubt in regular expressions
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 ____________.
User Avatar
525
views
2 answers
0 votes
abhiram144 asked Jul 16, 2018
525 views
Doubt Regular Language and regular expressions
Is it safe to say (ab*)* = (a+b)* - {b}?or any string will be missed apart from b
User Avatar
Link Copied!