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?
L = { | |
L = { | |
L = { | |
L = { |
Question 1 Explanation:
Question 2 |
Recursively enumerable languages are not closed under
Union | |
Intersection | |
Complementation | |
Concatenation |
Question 2 Explanation:
Recursively enumerable language are not closed under complementation.