Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability
Turing-recognizable languages are closed under which of the below operations?
I. Intersection
II. Set Difference
III. Complementation
IV. Kleene closure
1
IV only
2
I and IV only
3
I, II, and IV only
4
I, II, III, and IV