The regular expression for the language recognized by the finite state automaton of figure is ______
Clearly , looking into DFA we can say that C is Dead state.
Using Arden's theoram to find the regular expression :
A = ε + A0 = ε0* = 0*
B = A1 + B1 = 0*1 +B1 = 0*11* = 0*1*
Therefore answer is 0*1*
PS : Ardens theoram -
Let P and Q be two regular expressions.
If P does not contain null string, then R = Q + RP has a unique solution that is R = QP*
How did you simplified B = A1 + B1 = 0*1 +B1 = 0*11*.
according to Arden's theorem shouldn't it be: B=B.1+0*11* =1*0*1 ?
B= 0*1 + B1
R=B, Q=0*1 and P=1
then by arden's theorem,
u have to union both the A and B values becoz there are two final states n given FA
yes sir TRUE... working on it :). But this...