ConceptTheory & Algos
Pumping lemma for CFLs
A property of context-free languages that states any sufficiently long string in the language can be split into five parts such that the middle parts can be repeated any number of times 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
4The lectures that define it or assume it, and the concepts next to it.