Show indexed articles as search result.

The articles of this volume will be reviewed individually.
Indexed articles:
Farwer, Berndt, \(\omega\)-automata, 3-21, 365-376 [Zbl 1021.68045]
Mazala, René, Infinite games, 23-38, 365-376 [Zbl 1021.91502]
Roggenbach, Markus, Determinization of Büchi-automata, 43-60, 365-376 [Zbl 1021.03510]
Klaedtke, Felix, Complementation of Büchi automata using alternation, 61-77, 365-376 [Zbl 1021.03509]
Schwoon, Stefan, Determinization and complementation of Streett automata, 79-91, 365-376 [Zbl 1021.68047]
Küsters, Ralf, Memoryless determinacy of parity games, 95-106, 365-376 [Zbl 1021.91501]
Klauck, Hartmut, Algorithms for parity games, 107-129, 365-376 [Zbl 1021.91500]
Nießner, Frank, Nondeterministic tree automata, 135-152, 365-376 [Zbl 1021.68046]
Kirsten, Daniel, Alternating tree automata and parity games, 153-167, 365-376 [Zbl 1021.03030]
Zappe, Júlia, Modal \(\mu\)-calculus and alternating tree automata, 171-184, 365-376 [Zbl 1021.03020]
Alberucci, Luca, Strictness of the modal \(\mu\)-calculus hierarchy, 185-201, 365-376 [Zbl 1021.03012]
Weyer, Mark, Decidability of S1S and S2S, 207-230, 365-376 [Zbl 1021.03001]
Reinhardt, Klaus, The complexity of translating logic to finite automata, 231-238, 365-376 [Zbl 1021.03031]
Rohde, Philipp, Expressive power of monadic second-order logic and modal \(\mu\)-calculus, 239-257, 365-376 [Zbl 1021.03019]
Leucker, Martin, Prefix-recognizable graphs and monadic logic, 263-283, 365-376 [Zbl 1021.03505]
Berwanger, Dietmar; Blumensath, Achim, The monadic theory of tree-like structures, 285-301, 365-376 [Zbl 1021.68051]
Cachat, Thierry, Two-way tree automata solving pushdown games, 303-317, 365-376 [Zbl 1021.68044]
Räsch, Thoralf, Introduction to guarded logics, 321-341, 365-376 [Zbl 1021.03018]
Berwanger, Dietmar; Blumensath, Achim, Automata for guarded fixed point logics, 343-355, 365-376 [Zbl 1021.03014]
Fritz, Carsten, Some fixed point basics, 359-376 [Zbl 1021.03015]