Question:-
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
Option (A)
L2 – L1 is recursively enumerable
Option (B)
L1 – L3 is recursively enumerable
Option(C)
L2 Ç L1 is recursively enumerable
Option(D)
L2 Ç L1 is recursively enumerable
Correct Option:
(B)
Question Solution:
Union of two recursive enumerable is not R.E and also the Intersection, L2-L1 is r.E is True but L1 – L3 need not to be recursive enumerable
question-answer-faq-2221