in Theory of Computation
680 views
0 votes
0 votes
Can you please draw the DFA for given regex (ab*)*
in Theory of Computation
by
680 views

2 Comments

When I tried on JFLAP conversion the RE i get is this (λ+a+(a+a)bb*)*(λ+a+(a+a)bb*)

Is this correct please reply

0
0
This is not the correct answer since the question clearly asked to draw a DFA. In the diagram above, for every input symbol, i.e, there is no transition from state q0 on input symbol ‘b’ and similarly there is also no transition from state q1 on input symbol ‘a’.
0
0

1 Answer

3 votes
3 votes
Best answer

 DFA  is as :

selected by

2 Comments

Can not start from b
0
0
Thats why b is on dead state
0
0

Related questions