Theory-of-Computation
December 6, 2023Theory-of-Computation
December 6, 2023GATE 1996
|
Question 33
|
If L1 and L2 are context free languages and R a regular set, one of the languages below is not necessarily a context free language. Which one?
|
L1, L2
|
|
|
L1 ∩ L2
|
|
|
L1 ∩ R
|
|
|
L1 ∪ L2
|
Question 33 Explanation:
Context free languages are not closed under intersection.
Correct Answer: B
Question 33 Explanation:
Context free languages are not closed under intersection.