Advanced Automata Theory
Lecture in the summer term 2021
In this lecture of theoretical computer science, we extend concepts and results of the undergraduate course on automata theory. These results can be used for information processing and system construction/analysis.
The following topics are covered in the course:
- the minimization problem for nondeterministic automata
- connection of automata and logic
- automata on finite trees
- algorithms for infinite transition systems
- basic undecidability results in automata theory
Knowledge of automata theory as presented in basic courses is required for participation.
The course will be held in English.
There will be weekly exercise sets. Completing these successfully, meaning at least 50% of possible points were collected, is necessary for admittance to the examination.
There will be written exams. The exact modalities of the exams will be announced in Moodle.