Which of the following statements is false?

PYQ GATE 2008

Which of the following statements is false?

  1. A.

    Every NFA can be converted to an equivalent DFA

  2. B.

    Every non-deterministic Turing machine can be converted to an equivalent deterministic Turing machine

  3. C.

    Every regular language is also a context-free language

  4. D.

    Every subset of a recursively enumerable set is recursive

Attempted by 185 students.

Sign up free to check your answer

Sign up free

Explore the full course: Theory Of Computation

Loading lesson…