UGC-NET | UGC NET CS 2015 Jun – III | Question 19

Minimal deterministic finite automaton for the language L = {0n | n ≥ 0, n ≠ 4} will have:
(A) 1 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:
There are 5 final states among 6 states.
So, option (D) is correct.


Quiz of this Question



My Personal Notes arrow_drop_up


Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.