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. Which one of the following is FALSE?
a. There is unique minimal DFA for every regular language
b. Every NFA can be converted to an equivalent PDA
c. Complement of every context-free language is recursive
d. Every nondeterministic PDA can be converted to an equivalent deterministic PDA
Answer:Every nondeterministic PDA can be converted to an equivalent deterministic PDA

Similar Questions:



View All Questions on: Theory of Computation(TOC)


Start The Conversation: