Q19,p3,j15. Minimal deterministic finite automation for the language L={0n, | n>=0, n|= 4} will have:

Options

A.)One final state among  5 states.

B.) 4 final states among 5 states.

C.) 1 final state among 6 states.

D.) 5. Final states among 6 states.

Answer D.

Explanation.

Accepted words are {Epsilon,o,oo,ooo,ooooo,oooooo---}