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.

The set of all strings ending with the pattern bab.

The set of all strings containing an even number of b's.

The set of all strings containing the pattern bab.

The set of all strings ending with the pattern bab.

The set of all strings not containing the pattern aba.

GATE 2025 CSE & IT Q50 — Computer Science

GATE 2025Set 1Q50MCQanswer keyexplanation soonmedium

Computer Science · Theory of Computation - Automata Theory

Concept intelligence

Jump into a concept drill from this question.

Figure from the original GATE 2025 paper. (IIT Roorkee archive)

Studying seriously for GATE CSE?

Keep browsing free. Pro unlocks the paid study loop: explanations, topic mastery, mistake notebook, and custom PYQ drills.

Recurring concept

Theory of Computation - Automata Theory has appeared in GATE CSE & IT 4 times across 2 years (2017, 2025).

More questions on Theory of Computation - Automata Theory

📊 has diagram

DFAAutomataLanguage AcceptanceTheory of Computation