Let \(⟨M⟩\) denote an encoding of an automaton \(M\). Suppose that Σ={0,1}.…
PYQ GATE 2021
Let denote an encoding of an automaton . Suppose that Σ={0,1}. Which of the following languages is/are NOT recursive?
- A.
- B.
- C.
- D.
Attempted by 102 students.
Sign up free to check your answer
Sign up freeLoading lesson…

