GATE Papers >> CSE >> 2013 >> Question No 17

Question No. 17 CSE | 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.


Answer : (C) 2 only


Comments
No Comments
Leave a comment