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 statements is not correct ?
1
Every recursive language is recursively enumerable.
2
L = {0n 1n 0n | n = 1, 2, 3, ....} is recursively enumerable.
3
Recursive languages are closed under intersection
4
Recursive languages are not closed under intersection