Let ⟨ M ⟩ denote an encoding of an automation M. Suppose that ∑ = {0, 1}. Which of the following languages is/are NOT recursive?

Question

Let ⟨  M  ⟩  denote an encoding of an automation M. Suppose that ∑ = {0, 1}. Which of the following languages is/are NOT recursive?

Examsnet · Accepted Answer

Correct Answer is : L = { <M> | M is a PDA such that L(M) = ∑*}

GATE Computer Science (CS) 2021 Shift 1 Solved Paper