Computer Sciences > GATE 2015 SET-2 > Automata
The number of states in the minimal deterministic finite automaton corresponding to the regular expression (0 + 1)*(10) is _______.
Correct : 3
Similar Questions
Which of the regular expressions given below represent the following DFA?
I) 0*1(1 + 00*1)* II) 0*1*1 + 11*0*1 III) (0 + 1)*1
Which of the regular expressions given below represent the following DFA?
I) 0*1(1 + 00*1)* II) 0*1*1 + 11*0*1 III) (0 + 1)*1
Which of the regular expressions given below represent the following DFA?
I) 0*1(1 + 00*1)* II) 0*1*1 + 11*0*1 III) (0 + 1)*1
Total Unique Visitors
Loading......