

MCQOPTIONS
Saved Bookmarks
1. |
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 ∩ L1 is recursively enumerable (D) L2 ∪ L1 is recursively enumerable |
A. | A |
B. | B |
C. | C |
D. | D |
Answer» C. C | |