Question 10116 – Theory-of-Computation
December 6, 2023Question 10140 – Theory-of-Computation
December 6, 2023Question 10139 – Theory-of-Computation
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?
Correct Answer: B
Question 14 Explanation:
Context free languages are not closed under intersection.
L1, L2
L1 ∩ L2
L1 ∩ R
L1 ∪ L2
Subscribe
Login
0 Comments