Automata, Formal Languages and Complexity
Pumping Lemma for Regular Languages

Jörg Endrullis
Vrije Universiteit Amsterdam