A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. The minimum number of states of the non-deterministic finite automation which accepts the language
{a b a bn| n  ≥  0} ∪ {a b an|n  ≥ 0} is 
a. 3
b. 4
c. 5
d. 6
Answer:5

Similar Questions:



View All Questions on: Theory of Computation(TOC)


Start The Conversation: