Advanced Automata Theory


Lecture in the summer term 2017

Lecture slide vom AAT illustrating the block refinement algorithm Copyright: © C. Löding


Tue, 12:15 - 1:45pm (AH I)
Wed, 9:15 - 10:00am (AH II)

Exercise Class
Fri, 1:15  - 2:45pm (AH I)



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.

Time and Places

Tuesday, 12:15pm - 1:45pm in 2350|009 (AH I)
Wednesday, 9:15am - 10:00am in AH II


Christof Löding



There will be weekly exercise sets. Completing these successfully, reaching at least 50% of all possible points, is necessary for admittance to the examination.

The solutions of the exercises will be presented on Friday, 1:15pm - 2:45pm in AH I.


There will be written exams. The exact modalities of the exams will be announced later in L2P.


External Links