CFL

Question 1
Context-free languages are
A
closed under union
B
closed under complementation
C
closed under intersection
D
closed under Kleene closure
E
Both A and D
       Theory-of-Computation       CFL       Gate-1992
Question 1 Explanation: 
CFL's are not closed under intersection and complementation.
There is 1 question to complete.