Theory of Computation Lecture 27: Closure Properties of Context-Free Languages (2)

Theory of Computation Lecture 27: Closure Properties of Context-Free Languages (2):
Non-Disclosure under Intersection and Complementation

References:

“Introduction to the Theory of Computation”, Michael Sipser, Third Edition, Cengage Learning

“An Introduction to Formal Languages and Automata”, Peter Linz, Jones and Bartlett Publishers