Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Undecidability
Given below are two statements:
Statement I: The problem "Is L1 ∧ L2 = ϕ?" is undecidable for context sensitive languages L1 and L2.
Statement II: The problem "Is WϵL?" is decidable for context sensitive language L, (where W is a string).
In the light of the above statements, choose the correct answer from the options given below
1
Both Statement I and Statement II are true
2
Both Statement I and Statement II are false
3
Statement I is correct but Statement II is false
4
Statement I is incorrect but Statement II is true