engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Undecidability
If L(M) be the language accepted by a Turing machine M, then which of the following is decidable?
1
L(M1) ∩ L(M2) is accepted by M
2
\(\overline {L\left( M \right)} \) is accepted by M
3
L(M) is accepted by Finite Automaton
4
L(M1) ⊆ L(M2) is accepted by M