pumping lemma

Fetched 2026-10-26 (cache).

Datamuse reports no synonyms or antonyms for this word.

Noun

1. {{lb|en|computer science}} A [[lemma]] which states that for a language to be a member of a language class any [[sufficiently]] long string in the language contains a section that can be removed or repeated any number of times with the resulting string remaining in the language, used to determine if a particular [[language]] is in a given language class (e.g. not [[regular]]).

Source: Wiktionary · CC BY-SA 4.0 (Wiktionary dump) · cached copy, not a rewrite.