| Date | 1. hour | 2. hour | Topic | |||
| Mon 2.2. | Problem 1 | Lecture | Computational problems | |||
| Thu 5.2. | Problem 2 | Lecture | Regular expressions | |||
| Mon 9.2. | Problem 3 | Lecture | Automata | |||
| Thu 12.2. | Lecture | Lecture | Minimization, non-determinism | |||
| Mon 16.2. | Lecture | Problem 4 | e-automata, determinization | |||
| Thu 19.2. | Lecture | Problem 5 | regular expr. vs. automata | |||
| Mon 23.2. | Lecture | PL game | PL, applications | |||
| Thu 26.2. | Lecture | Problem 6 | Grammars | |||
| Mon 1.3. | Problem 7 | Lecture | Pushdown automata | |||
| Thu 4.3. | Lecture | Lecture | Parsing, LL(1)-grammars | |||
| Mon 8.3. | Problem 8 | Lecture | Parsing, CYK | |||
| Thu 11.3. | Lecture | Lecture | CNF, Restrictions, applications | |||
| Mon 15.3. | ART EXHIBITION | ART EXHIBITION | ||||
| Thu 18.3. | EXAM | EXAM | ||||
| Mon 22.3. | Problem 9 | Lecture | Turing machines | |||
| Thu 25.3. | Lecture | Lecture | Nondeterminism, unrestricted languages |
|||
| Mon 29.3. | Lecture | Problem 10 | Universal Turing machines | |||
| Thu 1.4. | Lecture | Problem 11 | Unsolvability | |||
| Mon 5.4. | Revision | Last problem session | ||||
| Thu 22.4. | 2nd middle term exam | 10.00-13.00 | ||||