1,067 views
1 1 vote

1 Answer

Best answer
2 2 votes
L1 = epsilon, ab,abab....

L2 =epsilon,ab,aabb,aaabbb.....

So L={epsilon,ab}

DFA=4 states  NFA=3 states
• selected by
Position:
Show:

Related questions

0 0 votes
0 0 answers
478
478 views
Samujjal Das asked Nov 13, 2016
478 views
0 0 votes
1 1 answer
873
873 views
Tariq Husain Khan asked Nov 11, 2016
873 views
Which of the following is decidable ?(A). Determining whether TM accepts regular language(B). Determining whether given First order predicate is satisfiable or not(C). De...
3 3 votes
1 1 answer
1.6k
1.6k views
Kapil asked Nov 9, 2016
1,575 views
Consider languages L1 and L2 over {0,1} alphabet . L2= { w | w contains some x as a substring and x belongs to L1 }Which of the following m...
5 5 votes
1 answers 1 answer
2.1k
2.1k views
KISHALAY DAS asked Nov 7, 2016
2,131 views
L is a language in which number of b's is twice the number of a's. M is a language in which every 'a' is being followed by exactly 2b's. N is a language in which all a’s ...