Gate CS-2007 Question Paper With Solutions

Q. 81 A minimum state deterministic finite automation accepting the language

L={w | w ε {0,1} *,  , number of 0s &1s in w are divisible by 3 and 5, respectively}

has

(A) 15 states

(B) 11 states

(C) 10 states

(D) 9 states

Answer: (A)

Explanation: