Q. 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? (Solved)
1. L1 n L2 is a deterministic CFL
2. L3 n L1 is recursive
3. L1 U L2 is context free
4. L1 n L2 n L3 is recursively enumerable
- b. L3 n L1 is recursive