Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Undecidability
Which of the following statements is FALSE?
1
If G1 is unrestricted grammar, then the problem L(G1)=L(G1})*is undecidable.
2
If G1 is unrestricted grammar and G2 is regular grammar then the problem L(G1)∩L(G2)=ϕ is undecidable.
3
If a language is non-recursive, then there is no membership algorithm for it.
4
If M1 and M2 are two Turing machines. then the problem L(M1)⊆L(M2) is decidable.
5
Question Not Attempted