GATE CS 2025 (Forenoon) — Question 50

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

Consider the following deterministic finite automaton (DFA) defined over the alphabet, \( \Sigma = \{a, b\} \). Identify which of the following language(s) is/are accepted by the given DFA.
Question image
  1. A
    The set of all strings containing an even number of \( b \)'s.
  2. B
    The set of all strings containing the pattern \( bab \).
  3. C
    The set of all strings ending with the pattern \( bab \).
  4. D
    The set of all strings not containing the pattern \( aba \).
Practise the full 2025-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