Let L1 be a recursive language. Let L2 and L3 be languages that are…
GATE · 2010 · CS · Computer Science & IT
Let L1 be a recursive language. Let L2 and L3 be languages that are recursively enumerable but not recursive. Which of the following statements is not necessarily true?
- A.
L2 – L1 is recursively enumerable
- B.
L1 – L3 is recursively enumerable
- C.
L₂ ∩ L₃ is recursively enumerable
- D.
L₂ ∪ L₃ is recursively enumerable
Attempted by 96 students.
Sign up free to check your answer
Sign up freeLoading lesson…