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 of the following statements is false?
a. Every NFA can be converted to an equivalent DFA
b. Every non-deterministic Turing machine can be converted to an equivalent deterministic Turing machine
c. Every regular language is also a context-free language
d. Every subset of a recursively enumerable set is recursive
Answer:Every subset of a recursively enumerable set is recursive

Similar Questions:



View All Questions on: Theory of Computation(TOC)


Start The Conversation: