Discussion Forum
Que.  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 
a.  15 states 
b.  11 states 
c.  10 states 
d.  9 states 
Answer:15 states
