engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Undecidability
Which of the following is/are true if L(S) is a context-sensitive language?
1
\(\overline {L\left( S \right)}\) is context sensitive language
2
For a context-sensitive language L(S) and a string x, whether x ϵ L(M).
3
L(S1) - L(S2) is context-sensitive language
4
L(S) is finite or not