Source: wikibot/pumping-lemma-for-regular-languages
= 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.