1. Knowra
  2. Ogden's lemma
  3. Linked from

Linked from

The 2 pages that link to Ogden's lemma, each with the reason it gives.

All 2Compared with 2
  • Pumping lemma for regular languagesCompared with: It offers stronger pumping constraints for context-free-language proofs, not regularity tests.

  • Pumping lemma for context-free languagesCompared with: It can prove non-context-freeness when the ordinary lemma's decompositions are too unconstrained.

Machine generatedConnect to another ideaRandom page