Skip to content
Related Articles
Get the best out of our app
GFG App
Open App
geeksforgeeks
Browser
Continue

Related Articles

ISRO | ISRO CS 2017 | Question 24

Improve Article
Save Article
Like Article
Improve Article
Save Article
Like Article

Let L1 be regular language, L2 be a deterministic context free language and L3 a recursively enumerable language, but not recursive. Which one of the following statements is false?

(A) L3 ∩ L1 is recursive
(B) L1 ∩ L2 ∩ L3 is recursively enumerable
(C) L1 ∪ L2 is context free
(D) L1 ∩ L2 is context free


Answer: (A)

Explanation: Refer GATE-CS-2006 | Question 33
Option (A) is correct.

Quiz of this Question

My Personal Notes arrow_drop_up
Last Updated : 16 Mar, 2018
Like Article
Save Article
Similar Reads