GATE CS 2023 (Forenoon) — Question 63

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

Consider the language \(L\) over the alphabet \(\{0, 1\}\), given below: \(L = \{w \in \{0, 1\}^* \mid w \text{ does not contain three or more consecutive 1's}\}\). The minimum number of states in a Deterministic Finite-State Automaton (DFA) for \(L\) is ________.
Practise the full 2023-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