Automata,
Logics,
and Infinite Games 2001:
Dagstuhl,
Germany
Erich Grädel, Wolfgang Thomas, Thomas Wilke (Eds.):
Automata, Logics, and Infinite Games: A Guide to Current Research [outcome of a Dagstuhl seminar, February 2001].
Lecture Notes in Computer Science 2500 Springer 2002, ISBN 3-540-00388-6
Part I. Introduction
Part II. Determinization and Complementation
Part III. Parity Games
Part IV. Tree Automata
Part V. Modal µ-Calculus
- Júlia Zappe:
Modal µ-Calculus and Alternating Tree Automata.
171-184

- Luca Alberucci:
Strictness of the Modal µ-Calculus Hierarchy.
185-201

Part VI. Monadic Second-Order Logic
- Mark Weyer:
Decidability of S1S and S2S.
207-230

- Klaus Reinhardt:
The Complexity of Translating Logic to Finite Automata.
231-238

- Philipp Rohde:
Expressive Power of Monadic Second-Order Logic and Modal µ-Calculus.
239-257

Part VII. Tree-like Models
Part VIII. Guarded Logics
Part IX. Appendices
Copyright © Mon Nov 30 20:08:40 2009
by Michael Ley (ley@uni-trier.de)