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

PYQ GATE 2025

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 162 students.

Sign up free to check your answer

Sign up free

Explore the full course: Theory Of Computation

Loading lesson…