GATE | GATE-CS-2017 (Set 1) | Question 31

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 ______.

Note: This questions appeared as Numerical Answer Type.

(A) 3
(B) 4
(C) 5
(D) 6


Answer: (B)

Explanation: g20172_31

This solution has been contributed by Abhishek Kumar.

Quiz of this Question

My Personal Notes arrow_drop_up