We require a four state automaton to recognize the regular expression $(a\mid b)^*abb$
NFA for regular expression $(a+b)^*abb$ and its equivalent DFA will be as follows:
@Praveen Saini Sir What is the meaning of (a/b)* the question,is it (a+b)* what they have meant?
state a b
qo q0q1 q0
q1 ^ q2
q2 ^ q3
q3 ^ ^
q0q1 q0q1 q0q2
q0q2 q0q1 q0q3
q0q3 q0q1 q0
q3 is final state so q0q3 also final state. Total 6 states.
Where am I going wrong? Pls help @Praveen Saini
@shraddha priya , there is no need of q1, q2 and q3 check once.
@Praveen Saini sir construct an NFA for regular expression (a+b)* abb and then convert it into DFA, will that be okk sir ??