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
Answer» B. L1-L3 is recursively enumerable
2.4k
0
Do you find this helpful?
36

View all MCQs in

Theory of Computation

Discussion

No comments yet

Related MCQs