Chapter 0 Preface¶
Chapter 1 Introduction¶
Chapter 2 Mathematical Background¶
Chapter 3 Finite Acceptors¶
Chapter 4 Regular Languages¶
- 4.1. Regular Expressions
- 4.1.1. Definition and Examples of Regular Expressions
- 4.1.2. Converting a Regular Expression to a NFA
- 4.1.3. Regular Expression VS Regular Language Example
- 4.1.4. Regular Expression to Minimized DFA Example
- 4.1.5. Converting Regular Languages to Regular Expressions
- 4.1.6. Converting Regular Languages to Regular Expressions Example
- 4.2. Regular Expressions Exercises
- 4.3. More Regular Expressions Exercises
- 4.4. Regular Grammars
- 4.4.1. Introduction to regular grammar
- 4.4.2. NFA from Regular Grammar
- 4.4.3. Regular Grammar to NFA Example
- 4.4.4. Right-linear Regular Grammar from NFA
- 4.4.5. Regular Grammar from NFA Example
- 4.4.6. Left Regular Grammars
- 4.4.7. RegEx to Right Regular Grammar
- 4.4.8. RegEx to Left Regular Grammar
- 4.4.9. Something to Think About
- 4.5. Regular Grammars Exercises
- 4.6. More Regular Grammar Exercises
- 4.7. Closure Properties of Regular Grammars
Chapter 5 Identifying Non-regular Languages¶
- 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.4. Pumping Lemma
- 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.15. Adversary game
- 5.1.16. Adversary game examples
Chapter 6 Context-Free Grammars and Languages¶
- 6.1. Context-Free Languages
- 6.1.1. Context-Free Languages
- 6.1.2. String Derivation
- 6.1.3. Derivation Trees
- 6.1.4. Derivation Trees Example
- 6.1.5. Practice question 1
- 6.1.6. Membership Problem
- 6.1.7. Practice question 2
- 6.1.8. Ambiguity
- 6.1.9. Precedence Practice
- 6.1.10. Unambiguous grammar parse tree Example
- 6.1.11. Extended BNF
- 6.2. CFL exercises
- 6.3. Transforming Grammars
- 6.4. Transforming Grammars Exercises
