Pumping-lemma Definition
noun
(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).
Wiktionary
Other Word Forms of Pumping-lemma
Noun
Singular:
pumping-lemmaPlural:
pumping-lemmas, pumping-lemmataRelated Articles
Find Similar Words
Find similar words to pumping-lemma using the buttons below.