Discussion Forum
Que.  The minimum number of states of the nondeterministic finite automation which accepts the language {a b a bn n ≥ 0} ∪ {a b ann ≥ 0} is 
a.  3 
b.  4 
c.  5 
d.  6 
Answer:5 
Urvashi :(September 04, 2019)
Plz explain this

Click to Add Comment 