| Date | Topic | |
| Mon 24.1. | Introduction | |
| Thu 27.1. | Computational problems | |
| Mon 31.1. | Regular expressions | |
| Thu 3.2. | Finite automata | |
| Mon 7.2. | Automata, Minimization | |
| Thu 10.2. | Non-determinism, determinization | |
| Mon 14.2. | e-automata, reg. expr. vs. automata | |
| Thu 17.2. | PL | |
| Mon 21.2. | PL, applications | |
| Thu 24.2. | Linear grammars vs. automata | |
| Mon 28.2. | Summary | |
| Thu 3.3. | 1. Middle term exam | |
| Mon 7.3. | Pushdown automata | |
| Thu 10.3. | Parsing, LL(1)-grammars | |
| Mon 14.3. | Parsing, CYK | |
| Thu 17.3. | CNF, Restrictions, applications | |
| Mon 21.3. | Turing machines | |
| Thu 31.3. | Nondeterminism, unrestricted languages |
|
| Mon 4.4. | Universal Turing machines | |
| Thu 7.4. | Unsolvability | |
| Mon 11.4. | Summary | |
| 2nd middle term exam | ||