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!
PIGEONHOLE PRINCIPLE BY MR. ANKUR GUPTA (AP, CSE)
Approved by AICTE, Ministry of HRD, Govt of India and Affiliated to MDU, Rohtak
VAISH COLLEGE OF ENGINEERING
