A minimum state deterministic finite automation accepting the language L={W W ? {0,1}*, number of 0s and 1s in are divisible by 3 and 5, respectively} has
A)15 states
B)11 states
C)10 states
D)9 states

Question

Quizplus · Accepted Answer

The language requires tracking the number of 0s divisible by 3 and the number of 1s divisible by 5. This requires a DFA with 3 states for 0s and 5 states for 1s, resulting in a total of 3 * 5 = 15 states.

A Minimum State Deterministic Finite Automation Accepting the Language L={W