Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Undecidability
Which of the following problem is/are undecidable for recursive language (L)?
1
Is L = ф?
2
Is w ∈ L̅, where w is a string?
3
Is L = R, where R is given regular set?
4
Is L = Σ*?