Participation
Please register for the course to gain access to the Adam workspace.
Lecture slides
| A1 | Organizational Matters | 16.2. | screen print4 print1 |
| A2 | Mathematical Foundations | 16.2. | screen print4 print1 |
| A3 | Proof Techniques | 18.2. | screen print4 print1 |
| B1 | Formal Languages & Grammars | 2.3. | screen print4 print1 |
| B2 | Regular Grammars: ε-Rules | 4.3. | screen print4 print1 |
| B3 | Finite Automata | 4./9.3. | screen print4 print1 |
| B4 | Finite Automata: Characterization | 9.3. | screen print4 print1 |
| B5 | Regular Languages: Closure Properties and Decidability | 11.3. | screen print4 print1 |
| B6 | Regular Languages: Regular Expressions | 16.3. | screen print4 print1 |
| B7 | Regular Languages: Pumping Lemma | 18.3. | screen print4 print1 |
| B8 | Context-free Languages: ε-Rules & Chomsky Normal Form | 23.3. | screen print4 print1 |
| B9 | Context-free Languages: Push-Down Automata | 25.3. | screen print4 print1 |
| B10 | Context-free Languages: Closure & Decidability | 30.3. | screen print4 print1 |
| B11 | Turing Machines I | 30.3./01.04 | screen print4 print1 |
| B12 | Turing Machines II | 01.04 | screen print4 print1 |
| B13 | Type-1 and Type-0 Languages: Closure & Decidability | 08.04 | screen print4 print1 |
| C1 | Turing Machines as Formal Model of Computation | 08./13.04 | screen print4 print1 |
| C2 | The Halting Problem | 13.04 | screen print4 print1 |
| C3 | Turing-Computability | 15.04 | screen print4 print1 |
| C4 | Reductions | 20.04 | screen print4 print1 |
| C5 | Post Correspondence Problem | 20./22.04. | screen print4 print1 |
| C6 | Rice’s Theorem | 22./27..4. | screen print4 print1 |
| D1 | Nondeterministic Algorithms, P and NP | 27.4. | screen print4 print1 |
| D2 | Polynomial Reductions and NP-completeness | 29.4. | screen print4 print1 |