Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability
Recursive languages are closed under which of the following operations?
I. Union
II. Complement
III. Concatenation
IV. Kleene star
1
I, II and III only
2
I, III and IV only
3
II, III and IV only
4
I, II, III, and IV