Tag: pumping lemma

Dec 07 2017

The Pumping Lemma for Regular Languages

Pumping Lemma DFA

There are two versions of the Pumping Lemma. One is for context free grammars and one is for regular languages. This post is about the latter. The Pumping Lemma describes a property that all natural languages share. While it cannot be used by itself to prove that any given language is regular, it can be …

Continue reading