1. Pumping lemmaIn the theory of formal languages in computability theory, a pumping lemma or pumping argument states that, for a particular language to be a member of a language class, any sufficiently long string in the language contains a section, or sections, that can be removed, or repeated any number of times, with the resulting string remaining in that language. The proofs of these lemmas typically require counting arguments such as the pigeonhole principle.
Read “Pumping lemma” on English Wikipedia
Read “反復補題” on Japanese Wikipedia
Read “Pumping lemma” on DBpedia
Read “Pumping lemma” on English Wikipedia
Read “反復補題” on Japanese Wikipedia
Read “Pumping lemma” on DBpedia
Discussions
Log in to talk about this word.