![Mcqmate logo](https://mcqmate.com/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/images/logos/logo-white.png)
McqMate
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 enumberable |
C. | L2 intersection L1 is recursively enumberable |
D. | L2 union L1 is recursively enumberable |
Answer» B. L1 – L3 is recursively enumberable |
View all MCQs in
Theory of Computation and Compiler DesignNo comments yet