Homepage of Wojciech Czerwiński: teaching

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)

For every problem you can get 0.7 points, which is divided equally into all the people, which have solved this problem.

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),

two of which are counted as twice big as normal. You can choose out of these 8 topics: 2 (for grade dostateczny), 3 (for grade dobry) or 4 (for grade bardzo dobry).

Grading

All the points sum up and are rounded to the nearest grade from the set {2, 3, 3.5, 4, 4.5, 5}. For example if you choose 3 topics (for which you get 4.0), solve one star problem, which was solved by 4 people (you get 0.7 / 4 = 0.175) and find 6 typos (you get 6 x 0.02 = 0.12) you have in total grade 4.295, which is rounded to 4.5.