| Date | Topic | Tasks |
| 19.2.2015 | Languages, finite automata | [PDF] |
| 26.2.2015 | Nerode theorem, pumping lemma, state equivalence | [PDF] |
| 5.3.2015 | Reduction of DFAs, non-deterministic automata | [PDF] |
| 19.3.2015 | Moore and Mealy machines, quotients, substitutions | [PDF] |
| 2.4.2015 | Regular expressions | [PDF] |
| 9.4.2015 | Two way automata | [PDF] |
| 16.4.2015 | Grammars and correspondence with finite automata | [PDF] |
| 23.4.2015 | Normal forms and pumping lemma for context-free languages | [PDF] |
| 30.4.2015 | Push down automata and context-free languages | [PDF] |
| 7.5.2015 | Context sensitive grammars | [PDF] |
| 14.5.2015 | Turing machines and enumeration | [PDF] |