Participation
Please register for the course to gain access to the Adam workspace.
Lecture slides
| A1 | Organizational Matters | 19.2. | screen print4 print1 |
| A2 | Mathematical Foundations | 19.2. | screen print4 print1 |
| A3 | Proof Techniques | 24.2. | screen print4 print1 |
| B1 | Formal Languages & Grammars | 26.2. | screen print4 print1 |
| B2 | Regular Grammars: ε-Rules | 3.3. | screen print4 print1 |
| B3 | Finite Automata | 3.3./ 5.3 | screen print4 print1 |
| B4 | Finite Automata: Characterization | 5.3. | screen print4 print1 |
| B5 | Regular Languages: Closure Properties and Decidability | 17.3. | screen print4 print1 |
| B6 | Regular Languages: Regular Expressions | 29.3. | screen print4 print1 |
| B7 | Regular Languages: Pumping Lemma | 24.3. | screen print4 print1 |
| B8 | Context-free Languages: ε-Rules & Chomsky Normal Form | 26.3. | screen print4 print1 |
| B9 | Context-free Languages: Push-Down Automata | 31.3. | screen print4 print1 |
| B10 | Context-free Languages: Closure & Decidability | 2.4. | screen print4 print1 |
| B11 | Turing Machines I | 2.4. 7.4. | screen print4 print1 |
| B12 | Turing Machines II | 7.4 9.4. | screen print4 print1 |
| B13 | Type-1 and Type-0 Languages: Closure & Decidability | 9.4. | screen print4 print1 |
| C1 | Turing Machines as Formal Model of Computation | 9.4. 14.4. | screen print4 print1 |
| C2 | The Halting Problem | 14.4. | screen print4 print1 |
| C3 | Turing-Computability | 16.4. | screen print4 print1 |
| C4 | Reductions | 23.4. | screen print4 print1 |