5.1. Identifying Non-regular Languages
5.1.1. Identifying Non-regular Languages
5.1.2. Proving that a languages is not regular
5.1.3. The Concept of Pumping
5.1.5. Pumping Lemma Example 1
5.1.6. Pumping Lemma Example 2
5.1.7. Pumping Lemma Example 3
5.1.8. Pumping Lemma Example 4
5.1.9. Pumping Lemma Example 5
5.1.10. Pumping Lemma Example 6
5.1.11. Use Closure Properties to prove L is not regular
5.1.12. Use Closure Properties to prove L is not regular: Example 1
5.1.13. Use Closure Properties to prove L is not regular: Example 2
5.1.14. Use Closure Properties to prove L is not regular: Example 3
5.1.16. Adversary game examples
