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!
![WhatsApp Image 2024-05-11 at 1.53.22 PM](https://vcertk.com/wp-content/uploads/2024/05/WhatsApp-Image-2024-05-11-at-1.53.22-PM.jpeg)
![WhatsApp Image 2024-05-11 at 1.53.22 PM (1)](https://vcertk.com/wp-content/uploads/2024/05/WhatsApp-Image-2024-05-11-at-1.53.22-PM-1.jpeg)
![WhatsApp Image 2024-05-11 at 1.53.23 PM](https://vcertk.com/wp-content/uploads/2024/05/WhatsApp-Image-2024-05-11-at-1.53.23-PM.jpeg)
![WhatsApp Image 2024-05-11 at 1.53.26 PM](https://vcertk.com/wp-content/uploads/2024/05/WhatsApp-Image-2024-05-11-at-1.53.26-PM.jpeg)
![WhatsApp Image 2024-05-11 at 1.53.27 PM](https://vcertk.com/wp-content/uploads/2024/05/WhatsApp-Image-2024-05-11-at-1.53.27-PM.jpeg)
![WhatsApp Image 2024-05-11 at 1.53.27 PM (1)](https://vcertk.com/wp-content/uploads/2024/05/WhatsApp-Image-2024-05-11-at-1.53.27-PM-1.jpeg)
![WhatsApp Image 2024-05-11 at 1.53.28 PM](https://vcertk.com/wp-content/uploads/2024/05/WhatsApp-Image-2024-05-11-at-1.53.28-PM.jpeg)
![WhatsApp Image 2024-05-11 at 1.53.28 PM (1)](https://vcertk.com/wp-content/uploads/2024/05/WhatsApp-Image-2024-05-11-at-1.53.28-PM-1.jpeg)
![WhatsApp Image 2024-05-11 at 1.53.28 PM (2)](https://vcertk.com/wp-content/uploads/2024/05/WhatsApp-Image-2024-05-11-at-1.53.28-PM-2.jpeg)
![WhatsApp Image 2024-05-11 at 1.53.29 PM](https://vcertk.com/wp-content/uploads/2024/05/WhatsApp-Image-2024-05-11-at-1.53.29-PM.jpeg)
![WhatsApp Image 2024-05-11 at 1.53.29 PM (1)](https://vcertk.com/wp-content/uploads/2024/05/WhatsApp-Image-2024-05-11-at-1.53.29-PM-1.jpeg)
![WhatsApp Image 2024-05-11 at 1.53.29 PM (2)](https://vcertk.com/wp-content/uploads/2024/05/WhatsApp-Image-2024-05-11-at-1.53.29-PM-2.jpeg)
![WhatsApp Image 2024-05-11 at 1.53.30 PM](https://vcertk.com/wp-content/uploads/2024/05/WhatsApp-Image-2024-05-11-at-1.53.30-PM.jpeg)
![WhatsApp Image 2024-05-11 at 1.53.30 PM (1)](https://vcertk.com/wp-content/uploads/2024/05/WhatsApp-Image-2024-05-11-at-1.53.30-PM-1.jpeg)
Admission Enquiry: Rohtak office: 7082008061/7082008062 Delhi office: 7082008063,7082008064
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!