Consider the following deterministic finite automaton (DFA) defined over the…

GATE · 2025 · CS · Set 1 · Computer Science & IT

Consider the following deterministic finite automaton (DFA) defined over the alphabet, $Σ = \{𝑎, 𝑏\}$. Identify which of the following language(s) is/are accepted by the given DFA.

1. A.

   The set of all strings containing an even number of $𝑏$’s.

2. B.

   The set of all strings containing the pattern $𝑏𝑎𝑏$.

3. C.

   The set of all strings ending with the pattern $𝑏𝑎𝑏$.

4. D.

   The set of all strings not containing the pattern $𝑎𝑏𝑎$.

Attempted by 123 students.