Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Undecidability
Which of the following problems are decidable?
1) Does a given program ever produce an output?
2) If L is a context-free language, then, is L̅ also context-free?
3) If L is a regular language, then, is L̅ also regular?
4) If L is a recursive language, then, is L̅ also recursive?
1
1, 2, 3, 4
2
1, 2
3
2, 3, 4
4
3, 4