A minimum state deterministic finite automaton accepting the language L={w | w…

PYQ GATE 2007

A minimum state deterministic finite automaton accepting the language L={w | w ε {0,1} *, number of 0s and 1s in w are divisible by 3 and 5, respectively} has

  1. A.

    15 states

  2. B.

    11 states

  3. C.

    10 states

  4. D.

    9 states

Attempted by 888 students.

Sign up free to check your answer

Sign up free

Explore the full course: Theory Of Computation

Loading lesson…