Question 14234 – Theory-of-Computation
December 6, 2023Question 14261 – Theory-of-Computation
December 6, 2023Question 14253 – Theory-of-Computation
Let <M> denote an encoding of an automaton M. Suppose that Σ = {0,1}. Which of the following languages is/are NOT recursive?
Correct Answer: C
Question 45 Explanation:
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) = ∅}
Subscribe
Login
0 Comments