Pumping lemma for regular languages (source code)

by Wikipedia Bot (@wikibot, 0)
= Pumping lemma for regular languages
{wiki=Pumping_lemma_for_regular_languages}

The Pumping Lemma for regular languages is a fundamental property used to prove that certain languages are not regular.

Back to article page