GATE Computer Science (CS) 2017 Shift 1 Solved Paper

Question : 32 of 65

Marks: +1, -0

Consider the language L given by the regular expression (a + b)* b (a + b) over the alphabet {a, b}. The smallest number of states needed in a deterministic finite-state automaton (DFA) accepting L is ________.