Register

Equivalence of regular expressions

1,027 views
0 0 votes
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 just worked for this case?

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · example of language ...Next → · Flip Flop Conversion
← Previous in category · example of language ...Next in category → · Automata for given R...
Position:
Show:

Related questions

0 0 votes
1 1 answer
1.2k
1.2k views
M_Umair_Khan42900 asked Dec 29, 2022
1,243 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)...
0 0 votes
3 answers 3 answers
484
484 views
Snehasis_Basu asked Nov 10, 2024
484 views
Regular Expressions (doubt)
0 0 votes
1 answers 1 answer
1.3k
1.3k views
goluabhinan asked Sep 11, 2018
1,304 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 ____________.
0 0 votes
2 answers 2 answers
1.1k
1.1k views
abhiram144 asked Jul 16, 2018
1,076 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