Automata Theory and Computability 15CS54

L2 can be defined in terms of the Complement and Union operations as follows: L1L2- L1- L2)-Therefore if CFL are closed under intersection then it is closed under compliment and if closed under compliment then it is closed under intersection. The proof is just showing two context-free languages that their intersection is not a context-free ... ................
................