• retagged by
1,077 views
2 2 votes

Here is the DFA and I need to convert it to regular expression. I get two different answers when removing states in different order.

i get b(c+ab)*d when I remove B first and then A while I get (bc*a)*bc*d when I eliminate A first. Which one is right?

1 Answer

0 0 votes
the correct regex will be   $a(c+ba)^{*}d$.

step1 : (c+ba)* is a loop occur at state B

step2: to reach A to B  a is needed and  from b to c "d" is needed.
Position:
Show:

Related questions

1 1 vote
1 1 answer
59
59 views
GO Classes asked 5 days ago
59 views
Consider the following regular expressions over the alphabet$\Sigma=\{a,b\}$.$R_1=a(a\cup b)^*$$R_2=b(a\cup b)^*$If $L(R)$ denotes the language associated with regular ex...
0 0 votes
1 1 answer
422
422 views
Lovepreet sharma asked Dec 5, 2024
422 views
Is this regular expression is correct for the Language = { w| number of a's in the string = 0 mod 3} on $\Sigma=\{a,b\}$