GATE | GATE-CS-2015 (Set 1) | Question 65

For any two languages L1 and L2 such that L1 is context free and L2 is recursively enumerable but not recursive, which of the following is/are necessarily true?

1. L1\' (complement of L1) is recursive 
2. L2\' (complement of L2) is recursive
3. L1\' is context-free 
4. L1\' ∪ L2 is recursively enumerable

(A)

1 only

(B)

3 only

(C)

3 and 4 only

(D)

1 and 4 only

Answer

Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :

Share your thoughts in the comments

GeeksforGeeks

Trending in News