A minimum state deterministic finite automation accepting the language L = {W W € {0,1}* , number of 0's and 1's in W 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 minimum state deterministic finite automaton for a language where the number of 0's is divisible by 3 and the number of 1's is divisible by 5 requires a state for each combination of remainders when divided by 3 and 5, respectively. This results in 3 * 5 = 15 states.

A Minimum State Deterministic Finite Automation Accepting the Language L