## JAO 2

### Notes

On the webpage of Mikołaj Bojańczyk you can find a book with most of the material of this lecture. I give point for finding errors there- 0.02 for typo
- 0.05 for bigger mistake
- more for finding more important errors

Here you can find a proof that coverability problem is in ExpSpace, which is missing in the book.

Here you can find notes from last year tutorials (in English) and here you can find similar notes from year 2016/17. I would be grateful for finding any mistakes.

### Star problems

You can find:- first series of star problems here (deadline is 11.01.2019)
- first series of star problems here (deadline is 8.02.2019)

### Exam

Please reserve an hour for your exam here. Exam will take around one hour. Here is a list of 6 topics:- Determinization of automata on omega-words
- Infinite games
- Distanca automata + Angluin algorithm
- Treewidth + Courcelle theorem (counted with weight 2)
- Vector addition systems
- Tarski theorem + polynomial grammars (counted with weight 2),