The number of states in the minimal deterministic finite automaton…
GATE · 2015 · CS · Set 2 · Computer Science & IT
The number of states in the minimal deterministic finite automaton corresponding to the regular expression (0 + 1)∗(10) is __________.
Attempted by 177 students.
Sign up free to check your answer
Sign up freeLoading lesson…