This lecture is a choice of slightly more advanced topics from automata theory.

The lecture is on Tuesdays, 12:15 in room 5820. The exercises are on Wednesdays, 16:15 in room 5820, with Wojciech Czerwiński. Here is a plan of the lecture. There was a similar lecture last year. Here are the topics for this year:

1. automata on infinite words: determinisation
2. games of infinite duration: the Büchi-Landweber theorem
3. distance automata: decidability of limitedness
4. treewidth and mso: Courcelle’s theorem
5. learning automata: the Angluin algorithm
6. transducers

Exam. The exam is an oral exam, which is mainly questions about the proofs of theorems. Please email me to choose a time. You can improve your exam grade using the star exercises.  Choose any subset of the 6 topics in the list above, here is the exchange rate:
• 2 topics: dostateczny
• 3 topics: dobry
• 4 topics: bardzo dobry