Discussion Forum
Que.  Minimal deterministic finite automaton for the language L = {0n  n ≥ 0 , n ≠ 4} will have 
a.  4 final states among 5 states 
b.  1 final state among 6 states 
c.  3 final state among 6 states 
d.  5 final state among 6 states 
Answer:5 final state among 6 states 
Sandeep :(September 21, 2020)
Can you defind

Click to Add Comment 