GATE Computer Science (CS) 2015 Shift 2 Solved Paper

Question : 45 of 65

Marks: +1, -0

The number of states in the minimal deterministic finite automaton corresponding to the regular expression (0 + 1)^∗(10) is ________.