Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Turing Machines
Let L1 be recursively enumerable language but not recursive, L2 be recurive language and L3 be context free language and L4 be regular language.
Which one of the following statements is/are true?
I. L1 ∩ L2 is recursively enumerable language
II. L*3 . L*4 is context free language
III. L2 ∩ L̅2 are recursive language
1
Only I
2
Only I and II
3
Only I and III
4
I, II and III