Pigeonhole Principle By Mr. Ankur Gupta( AP, CSE)

Q: How do we prove that a Language L is not Regular

A: Prove that there is no DFA that accepts L

Problem: It can be difficult to prove this

Solution: The Pumping Lemma!