pumping lemma
Description: A pumping lemma is a theorem in formal language theory that describes repeatable structure in sufficiently long strings of certain language classes.
Primary topic: semigroups and automata theory (84%)
Related topic: semigroups and automata theory (84%)
Wikidata ID: wiki/Q1059648
OpenAlex ID: keywords/pumping-lemma
