Pumping Lemma

Home > Languages > Formal Language > Turing Machines > Pumping Lemma

The Pumping Lemma is a tool used in the theory of formal languages that shows that certain languages are not regular. It is used to prove theorems in automata theory.