ConceptTheory & Algos
Pumping lemma for context-free languages
A theorem stating that every context-free language has a pumping length such that any string of length at least can be divided into five pieces satisfying specific repetition and length conditions while remaining in the language.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.