Table of Contents:
  • 1. [omega]-Automata / Berndt Farwer
  • 2. Infinite Games / Rene Mazala
  • 3. Determinization of Buchi-Automata / Markus Roggenbach
  • 4. Complementation of Buchi Automata Using Alternation / Felix Klaedtke
  • 5. Determinization and Complementation of Streett Automata / Stefan Schwoon
  • 6. Memoryless Determinacy of Parity Games / Ralf Kusters
  • 7. Algorithms for Parity Games / Hartmut Klauck
  • 8. Nondeterministic Tree Automata / Frank Niessner
  • 9. Alternating Tree Automata and Parity Games / Daniel Kirsten
  • 10. Model [mu]-Calculus and Alternating Tree Automata / Julia Zappe
  • 11. Strictness of the Modal [mu]-Calculus Hierarchy / Luca Alberucci
  • 12. Decidability of S1S and S2S / Mark Weyer
  • 13. The Complexity of Translating Logic to Finite Automata / Klaus Reinhardt
  • 14. Expressive Power of Monadic Second-Order Logic and Modal [mu]-Calculus / Philipp Rohde
  • 15. Prefix-Recognizable Graphs and Monadic Logic / Martin Leucker
  • 16. The Monadic Theory of Tree-like Structures / Dietmar Berwanger and Achim Blumensath
  • 17. Two-Way Tree Automata Solving Pushdown Games / Thierry Cachat
  • 18. Introduction to Guarded Logics / Thoralf Rasch
  • 19. Automata for Guarded Fixed Point Logics / Dietmar Berwanger and Achim Blumensath
  • 20. Some Fixed Point Basics / Carsten Fritz.