Which of the following statements is/are FALSE? 1. For every non-deterministic…

PYQ GATE 2013

Which of the following statements is/are FALSE?

1. For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine.

2. Turing recognizable languages are closed under union and complementation.

3. Turing decidable languages are closed under intersection and complementation.

4. Turing recognizable languages are closed under union and intersection.

  1. A.

    1 and 4 only

  2. B.

    1 and 3 only

  3. C.

    2 only

  4. D.

    3 only

Attempted by 265 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…