The smallest finite automaton that accepts the language {x | length of x is…

PYQ GATE 2002

The smallest finite automaton that accepts the language {x | length of x is divisible by 3} has:

  1. A.

    2 states

  2. B.

    3 states

  3. C.

    4 states

  4. D.

    5 states

Attempted by 1104 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…