News Dates Grading Content Exercises Exam Material

This lecture requires basic knowledge in automata theory, e.g., obtained during the course 'Einführung in die theoretische Informatik'. A detailed description of the contents can be found in the lecture notes. Here is an outline:

Automata on finite words

  1. Automata classes and conversions
  2. Minimization and reduction
  3. Boolean operations and tests
  4. Operations on relations
  5. Operations on finite universes: decision diagrams.
  6. Automata and logic
  7. Applications: pattern-matching, verification, Presburger arithmetic

Automata on infinite words

  1. Automata classes and conversions
  2. Boolean operations
  3. Emptiness check
  4. Applications: verification using temporal logic