Context free languages are closed under
Context Free Languages are:
1) Closed under Union, Kleen Closure
2) not closed under intersection and complementation.
However,
Deterministic CFL are closed under intersection, but not closed under Union.
b) union, kleen closure is the answer.
Lemma: The context-free languages are closed under union, concatenation and Kleene closure. That is, if $L_{1}$ and $L_{2}$ are context-free languages, so are$L_{1}$U$L_{2}$, $L_{1}$.$L_{2}$and $L_{1}*$ Proof: We will prove that the languages are closed by creating the appropriate grammars. Suppose we have two context-free languages, represented by grammars with start symbols $S_{1}$and $S_{2}$ respectively. First of all, rename all the terminal symbols in the second grammar so that they don't conflict with those in the first. Then:
So B is correct. Ref: http://www.cs.nuim.ie/~jpower/Courses/Previous/parsing/node43.html
64.3k questions
77.9k answers
244k comments
80.0k users