Teaching HPSC Lecturer (Technical) Mock Test 2024 Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability
If L1 and L2 are two recursively enumerable languages, then which one of the following languages is NOT necessarily recursively enumerable?
1
L1 L2
2
L1 - L2
3
L1 ∩ L2
4
L1 ∪ L2
5
Question Not Attempted