652 views
0 votes
0 votes
How many states will have the minimal DFA accepting the language L={w|wϵ{0,1}* and contains atleast one 0 and two 1's}

a) 6

b)7

c)8

d)12

1 Answer

3 votes
3 votes

6 States

Related questions

0 votes
0 votes
1 answer
2
cspsunny asked Aug 31, 2017
869 views
Let L1 = $0^+1^+$ and L2 = $(01)^+$, $L3 = \frac{L1}{ L2^*}$. The number of state needed for minimal DFA are _____.
4 votes
4 votes
3 answers
3
Vikrant Singh asked Jan 25, 2015
3,158 views
What is the number of states in the minimal DFA with input symbols {0,1,2} where 2nd last symbol is 1?A. 8B. 9C. 6D. None