Back to Questions

Computer Science Fundamentals Algorithms Objective

Mar 06, 2013

If L1 and L2 are context free language and R a regular set, then which one of the languages below is not necessarily a context free language?

Choose the correct answer:

A) L1 L2

B) L1 ∩ L2

C) L1 ∩ R

D) L1 ∪ L2

Detailed Explanation

Option b is right answer.

Discussion (0)

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

Share Your Thoughts

Feedback