1,760 views
1 votes
1 votes
Consider the regular language L = (111 + 111111)*. The minimum number
of states in any DFA accepting this language is :
(A) 3 (B) 5
(C) 8 (D) 9

2 Answers

Best answer
2 votes
2 votes

Given language L = (111 + 111111)* 

Strings , that belongs in the language 

$L= \left \{ \epsilon , 111,111111,111111111,......\right \}$

So, required DFA will be ,

selected by

Related questions

1 votes
1 votes
1 answer
1
sripo asked Nov 6, 2018
2,973 views
What is the number of states for the above DFA,please draw NFA,DFA and minimised DFA for the same.Also won't the language not accept epsilon?
0 votes
0 votes
1 answer
2