Theory-of-Computation
December 6, 2023Theory-of-Computation
December 6, 2023Theory-of-Computation
|
Question 2
|
Let <M> denote an encoding of an automaton M. Suppose that Σ = {0,1}. Which of the following languages is/are NOT recursive?
|
L = { | M is a DFA such that L(M) = Σ*}
|
|
|
L = { | M is a DFA such that L(M) = ∅}
|
|
|
L = { | M is a PDA such that L(M) = Σ*}
|
|
|
L = { | M is a PDA such that L(M) = ∅}
|
Question 2 Explanation:
Correct Answer: C
Question 2 Explanation: