Recursive-and-Recursively-Enumerable-Language

Question 1
Let <M> denote an encoding of an automaton M. Suppose that Σ = {0,1}. Which of the following languages is/are NOT recursive?
A
L = { | M is a DFA such that L(M) = Σ*}
B
L = { | M is a DFA such that L(M) = ∅}
C
L = { | M is a PDA such that L(M) = Σ*}
D
L = { | M is a PDA such that L(M) = ∅}
Question 1 Explanation: 
Question 2
Recursively enumerable languages are not closed under
A
Union
B
Intersection
C
Complementation
D
Concatenation
Question 2 Explanation: 
Recursively enumerable language are not closed under complementation.
There are 2 questions to complete.

Access quiz wise question and answers by becoming as a solutions adda PRO SUBSCRIBER with Ad-Free content

Register Now

If you have registered and made your payment please contact solutionsadda.in@gmail.com to get access