Computer Sciences > Gate 2016 Set-2 > DFA
The number of states in the minimum sized DFA that accepts the language defined by the regular expression
(0+1)*(0+1)(0+1)*
is __________________
(0+1)*(0+1)(0+1)*
is __________________
Correct : a
Similar Questions
The minimum possible number of states of a deterministic finite automaton that accepts a regular language L = {w1aw2 | w1, w2 ∈{a,b}* , |w1| = 2, w2>=3} is__...
The minimum possible number of states of a deterministic finite automaton that accepts a regular language L = {w1aw2 | w1, w2 ∈{a,b}* , |w1| = 2, w2>=3} is__...
The minimum possible number of states of a deterministic finite automaton that accepts a regular language L = {w1aw2 | w1, w2 ∈{a,b}* , |w1| = 2, w2>=3} is__...
Total Unique Visitors
Loading......