KnowraPumping lemma for context-free languagesLinked fromLinked fromThe 5 pages that link to Pumping lemma for context-free languages, each with the reason it gives.All 5Related 2Compared with 3Pumping lemma for regular languagesCompared with: Its multiple pumped sections address a stronger language family than the regular-language lemma.Myhill–Nerode theoremCompared with: It offers a different nonregularity proof when finite distinguishable prefixes are hard to exhibit.Ogden's lemmaCompared with: The ordinary lemma lacks the freedom to designate positions before choosing a decomposition.