GATE Computer Science (CS) 2016 Shift 2 Solved Paper
© examsiri.com
Question : 28 of 65
Marks:
+1,
-0
Consider the following types of languages: L1: Regular, L2: Context-free, L3 : Recursive, L4 : Recursively enumerable. Which of the following is/are TRUE?
I. L̅3 ∪ L4 is recursively enumerable
II. L̅2 ∪ L3 is recursive
III. L1* ∩ L2 is context-free
IV. L1 ∪ L̅2 is context-free
I. L̅3 ∪ L4 is recursively enumerable
II. L̅2 ∪ L3 is recursive
III. L1* ∩ L2 is context-free
IV. L1 ∪ L̅2 is context-free
Go to Question: