Robin Houston (via @CompSciFact): I hate the Pumping Lemma for regular languages. It’s a complicated way to express an idea that is fundamentally very simple, and it isn’t even a very good way to prove that a language is not regular. […] It’s easy enough to see that any derivative of a regular language is … Continue reading The Pumping Lemma, The Pigeonhole Principle, and Differentiating Languages