Let L1 be a regular language, L2 be a deterministic context-free language and…
PYQ GATE 2006
Let L1 be a regular language, L2 be a deterministic context-free language and L3 a recursively enumerable, but not recursive, language. Which one of the following statements is false?
- A.
L1 ∩ L2 is a deterministic CFL
- B.
L3 ∩ L1 is recursive
- C.
L1 ∪ L2 is context free
- D.
L1 ∩ L2 ∩ L3 is recursively enumerable
Attempted by 76 students.
Sign up free to check your answer
Sign up freeLoading lesson…

