Which of the following statements is false?
PYQ GATE 2008
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
Attempted by 185 students.
Sign up free to check your answer
Sign up freeLoading lesson…

