Chapter 0 Week 1§ -1.1. Formal Languages Course Introduction -1.2. Key Concepts -1.2.1. Key Concepts -1.3. Deterministic Finite Acceptors -1.3.1. Deterministic Finite Acceptors
Chapter 1 Week 2§ -1.1. Non-Deterministic Finite Acceptor -1.2. Minimizing the Number of States in a DFA
Chapter 2 Week 3§ -1.1. Regular Languages and Expressions -1.2. Regular Grammars -1.3. Closure Properties of Regular Languages
Chapter 3 Week 4§ -1.1. Identifying Non-regular Languages -1.2. Using Closure Properties to Prove a Language Non-Regular
Chapter 6 Week 8§ -1.1. Pushdown Automata -1.2. Equivalence of NPDA and CFG -1.3. Deterministic Pushdown Automata -1.4. Grammars for Deterministic Context-free Languages
Chapter 7 Week 9§ -1.1. Pumping Lemma for CFL -1.2. Closure Properties for CFLs -1.3. Turing Machines
Chapter 8 Week 10§ -1.1. Decideability vs. Acceptability -1.2. Combining Turing Machines -1.3. Turing Machine Extensions Index Search Page