Register

regular expressions

• reshown by
449 views
0 votes
0 votes
are these equal?

R1=(bc*a)*bc*d

R2=b(c+ab)*d

are r1 and r2 equal? Also can we obtain different regular expressions from a finite automata? if yes, how do we check if they're equal or not?
• reshown by
User Avatar

1 Answer

1 votes
1 votes

Yes, both R1 and R2 are equal. This the corresponding NFA for the given regular expressions.

Actually, both regular expressions are the two different regular expressions belonging to the same nfa. So, they are equal.

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
2
M_Umair_Khan42900 asked Dec 29, 2022
792 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
0 votes
0 votes
1 answer
3
moe12leb asked Nov 2, 2022
300 views
regular expressions
{(a* b)a } intersection {a*b*}, is this considered a regular language ? or not and how do i know ?
{(a* b)a } intersection {a*b*}, is this considered a regular language ? or not and how do i know ?
User Avatar
Link Copied!