Example:
11110100000111 should be accepted. There are 6 zeros. 6 is divisble by 2 and 3.
This machine required at least six states.
Number of zeros to be divisible by 2 and 3 it should be divisible by 6.
Answer is-
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 ).
64.3k questions
77.9k answers
244k comments
80.0k users