Closure properties and pumping lemmas

Closure of context-free languages under union, concatenation, star, homomorphism, inverse homomorphism, substitution, regular intersection and quotients, non-closure under intersection and complement, the pumping and Ogden lemmas, and Parikh's theorem.

• Closure properties of context-free languages
• Inverse homomorphic images of context-free languages
• Parikh images and semilinear sets
• Pumping lemma for context-free languages
• Non-closure of context-free languages
• Ogden's lemma
• Quotients of context-free languages

The dependency explorer needs JavaScript and its graph data.

Download the complete graph data.