Definitions
from Wiktionary, Creative Commons Attribution/Share-Alike License.
- noun computer science A
lemma which states that for a language to be a member of a language class anysufficiently 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 particularlanguage is in a given language class (e.g. notregular ).
Etymologies
Sorry, no etymologies found.
Support

Help support Wordnik (and make this page ad-free) by adopting the word pumping lemma.
Examples
Sorry, no example sentences found.
Comments
Log in or sign up to get involved in the conversation. It's quick and easy.