Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Turing Machines
The collection of Turing recognizable languages are closed under:
(i) Union
(ii) Intersection
(iii) Complement
(iv) Concatenation
(v) Star closure1
(i) only
2
Both (i), (iv)
3
(i), (ii), (iv) and (v)
4
All of the options