Infinite Computations and Games
Lecture in the winter term 2020/2021
Content
- automata on infinite words, the basic definitions and constructions
- deterministic automata and classes of acceptance conditions
- infinite games as models of reactive systems
- automata on infinite trees and their connection to games
- applications in logic, verification ans synthesis
Prerequisites
This course is only addressed to M.Sc. students. Note that B.Sc. students cannot take part in this course.
Knowledge of automata theory as presented in basic courses is required for participation.
Organization
The course will be held in English.
Lecturer
Exercises
There will be weekly exercise sets. Completing these successfully, reaching at least 50% of possible points, is necessary for admittance to the examination.
The exact modalities will be announced in the lecture.
Exam
There will be written exams.