ConceptTheory & Algos
Pumping lemma
A lemma stating that every regular language possesses a pumping length such that all sufficiently long strings can be decomposed into three parts that can be repeated.
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
2The lectures that define it or assume it, and the concepts next to it.