Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.17K Points
Coach

Q.) 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?

(A) L1 L2
(B) L1 ∩ L2
(C) L1 ∩ R
(D) L1 ∪ L2
Correct answer : Option (B) - L1 ∩ L2

Share

Discusssion

Login to discuss.