in Theory of Computation
2,527 views
4 votes
4 votes
  1. (aa*)b
  2. (abab)+(aaa+b)*
in Theory of Computation
2.5k views

2 Answers

7 votes
7 votes
Best answer

DFA for L((aa*)b) is 

DFA for L((abab+(aaa+b)*) is 

selected by

2 Comments

Here bbabab is accepted according to DFA but not Regular Xpression(2nd case).

0
0

sunil sarode  see * on (aaa+b) .The minimum string should be 0 here.not abab.

0
0
0 votes
0 votes

L(aa*)b

it isnot possible to draw the picture here the transition functions are as follows for above L

D(A,a)=(B)

D(B,a)= (B)

D(B,b)= C (final state)


Related questions