Teaching HPSC Lecturer (Technical) Mock Test 2024 Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Undecidability
If \( L\) and \(\bar L\) are recursively enumerable, then L is
1
Regular
2
Context-free
3
Context-sensitive
4
Recursive
5
Question Not Attempted