Pumping Lemma

A formal-language technique that gives necessary conditions for a language to be regular by showing that sufficiently long strings can be decomposed so that a central substring can be repeated (pumped) any number of times while the resulting strings remain in the language.