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

If L1 and L2 are CFL and R a regular set, one of the languages below is not necessarily a CFL. Which one?

Choose the correct answer:
A) L1L2
B) L1 ∪ L2
C) L1 ∩ L2
D) L1 ∩ R
Detailed Explanation
No Explanation
Discussion (0)

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

Share Your Thoughts
Feedback