You have Guest access.
Log In
Erich Grädel, Wolfgang Thomas and Thomas Wilke
Front matter
265-274
ω-Automata
197-204
Infinite Games
275-280
Determinization of Büchi-Automata
395-403
Complementation of Büchi Automata Using Alternation
257-264
Determinization and Complementation of Streett Automata
95-106
Memoryless Determinacy of Parity Games
553-563
Algorithms for Parity Games
227-232
Nondeterministic Tree Automata
405-411
Alternating Tree Automata and Parity Games
205-211
Modal μ-Calculus and Alternating Tree Automata
233-238
Strictness of the Modal μ-Calculus Hierarchy
213-220
Decidability of S1S and S2S
249-256
The Complexity of Translating Logic to Finite Automata
387-393
Expressive Power of Monadic Second-Order Logic and Modal μ-Calculus
369-377
Prefix-Recognizable Graphs and Monadic Logic
239-247
The Monadic Theory of Tree-like Structures
413-419
Two-Way Tree Automata Solving Pushdown Games
565-574
Introduction to Guarded Logics
343-355
Automata for Guarded Fixed Point Logics
221-226
Some Fixed Point Basics
Back matter
Berndt Farwer
René Mazala
Markus Roggenbach
Felix Klaedtke
Stefan Schwoon
Ralf Küsters
Hartmut Klauck
Frank Nießner
Daniel Kirsten
Júlia Zappe
Luca Alberucci
Mark Weyer
Klaus Reinhardt
Philipp Rohde
Martin Leucker
Dietmar Berwanger and Achim Blumensath
Thierry Cachat
Thoralf Räsch
Carsten Fritz
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info