Draw a DFA (Deterministic Finite Automation) that has a total number of zeros in the string divisble by two and three.

Question

Example: 

11110100000111 should be accepted. There are 6 zeros. 6 is divisble by 2 and 3.

 

This machine required at least six states. 

Answer 1

Number of zeros to be divisible by 2 and 3 it should be divisible by 6.

Answer 2

Answer is-

Comments

if you make initial state q0  as accepting(final) state, 

and maps state q5 to q0 for symbol 0 

then, there is no need of state q6 ( seventh state ).