Abbreviations

For more information about the lecture halls and seminar rooms, see our lecture room page. The names listed under "Technical Assistance" are student volunteers who will act as a contact person for technical questions of the lecturers and workshop speakers during the course or workshop.

Games, monadic logics, and synthesis

Two fundamental results of classical automata theory are decidability of the monadic second-order logic of order over the naturals, and the computability of the Church synthesis problem. In this course we will survey rich techniques and fundamental results from games, automata and logic. Main Topics: 1. Automata and compositional methods for decidability of Monadic logic. 2.Two person games of perfect information. 3. Games and synthesis problem.