M

Mr. Dubey • 52.49K Points
Coach

Q. 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) L2 intersection L1 is recursively enumerable
(D) L2 union L1 is recursively enumerable
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.


Question analytics