GATE CS 2017 (Forenoon) — Question 22

Theory of Computation (TOC)Regular Expressions & Finite Automata (DFA/NFA Min)NAT1 markMedium

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________.
Practise the full 2017-FN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkIntroduction to Automata Theory (Hopcroft & Ullman)Regular languages, CFGs, pushdown automata and Turing machines.
Practise more on Regular Expressions & Finite Automata (DFA/NFA Min)Timed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group