Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability
Which of the following problems is/are undecidable?
I. Whether the language accepted by a Turing machine is empty.
II. Whether the language accepted by a Turing machine is a regular language.
III. Whether a Turing machine has 10 states.
1
I and II only
2
I and III only
3
II and III only
4
II only