The GATE Grind

GATE 2008 CS – Question 48

Theory of Computation · Turing Machines and Undecidability · 2 marks · Multiple choice

Which is false?

  1. Every NFA has an equivalent DFA.
  2. Every nondeterministic TM has an equivalent deterministic TM.
  3. Every regular language is context-free.
  4. Every subset of a recursively enumerable set is recursive.

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (D) Every subset of a recursively enumerable set is recursive.

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Turing Machines and Undecidability questions

All Turing Machines and Undecidability questions →