The following determiniotic finite automata recognizes :

UGC NET 2007

The following determiniotic finite automata recognizes :

Three-state finite automaton: start state q0 goes to q1 on a; q1 loops on a and goes to q2 on b; q2 returns to q1 on a and q0 on b; no state has a double accepting circle.
  1. A.

    Set of all strings containing ‘ab’

  2. B.

    Set of all strings containing ‘aab’

  3. C.

    Set of all strings ending in ‘abab’

  4. D.

    None of the above

Attempted by 48 students.

Sign up free to check your answer

Sign up free

Explore the full course: Uppsc Polytechnic Lecturer 2025 Cs

Loading lesson…