GATE CS 2020 (Forenoon) — Question 61

Theory of Computation (TOC)Regular Expressions & Finite Automata (DFA/NFA Min)NAT2 marksMedium

Consider the following language: \( L = \{x \in \{a, b\}^* \mid \text{number of a's in } x \text{ is divisible by 2 but not divisible by 3}\} \) The minimum number of states in a DFA that accepts \( L \) is ________.
Practise the full 2020-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