engineering recuitment NIELIT Scientific Assistant Mock Test 2025 Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Undecidability
Recursive language is not closed under
1
complementation
2
substitution
3
set difference
4
intersection