KnowraContext-free languageLinked fromLinked fromThe 7 pages that link to Context-free language, each with the reason it gives.All 7Broader topic 1Related 1Narrower topic 3Compared with 2Formal languageBroader topic: It is a more expressive class than regular languages, but cannot describe every formal language.Regular languageCompared with: Context-free languages can express nested structures that finite automata cannot.Pushdown automatonNarrower topic: These languages are the automaton’s characteristic domain.Pumping lemma for regular languagesRelated: The regular-language lemma does not prove a language non-context-free; that requires stronger tools.Myhill–Nerode theoremCompared with: Context-free languages generally lack a finite-state equivalence-class characterization of this form.Pumping lemma for context-free languagesNarrower topic: The theorem states a necessary property shared by every language in this class.Ogden's lemmaNarrower topic: Ogden's lemma constrains sufficiently long strings in this language family.