Back to Questions
Computer Science Fundamentals Algorithms Objective
Nov 23, 2012

Let L1 be a regular language and L2 a deterministic CFL. L3 is recursively enumerable but not recursive. Which one of the following statement is FALSE?

Choose the correct answer:
A) L1 ∩ L2 is a DCFL
B) L3 ∩ L1 is recursive
C) L1 ∪ L2 is context-free
D) L1 ∩ L2 ∩ L3 is recursively enumerable
Detailed Explanation
No Explanation
Discussion (0)

No comments yet. Be the first to share your thoughts!

Share Your Thoughts
Feedback