What can be said about a regular language L over {a} whose minimal finite…

PYQ GATE 2000Modified — slightly modified from the official paper; see the solution

What can be said about a regular language L over {a} whose minimal finite state automaton has exactly two states forming a 2-cycle on the input a?

  1. A.

    L must be {an| n is odd}

  2. B.

    L must be {an| n is even}

  3. C.

    L must be {aⁿ | n ≥ 0}

  4. D.

    Either L must be {an | n is odd}, or L must be {an | n is even}

Attempted by 334 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…