Preface
On the topological complexity of tree languages
André Arnold, Jacques Duparc, Filip Murlak, Damian Niwinski
Nondeterministic controllers of nondeterministic processes
André Arnold, Igor Walukiewicz
Reachability in continuous-time Markov reward decision processes
Christel Baier, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen
Logical theories and compatible operations
Achim Blumensath, Thomas Colcombet, Christof Löding
Forest algebras
Mikolaj Bojanczyk, Igor Walukiewicz
Automata and semigroups recognizing infinite words
Olivier Carton, Dominique Perrin, Jean-Éric Pin
Deterministic graph grammars
Didier Caucal
Quantifier-free definable graph operations preserving recognizability
Bruno Courcelle
First-order definable languages
Volker Diekert, Paul Gastin
Matrix-based complexity functions and recognizable picture languages
Dora Giammarresi, Antonio Restivo
Applying Blackwell optimality: priority mean-payoff games as limits of multi-discounted games
Hugo Gimbert, Wieslaw Zielonka
Logic, graphs, and algorithms
Martin Grohe
Non-regular fixed-point logics and games
Stephan Kreutzer, Martin Lange
The universal automaton
Sylvain Lombardy, Jacques Sakarovitch
Deterministic top-down tree automata: past, present, and future
Wim Martens, Frank Neven, Thomas Schwentick
Expressive power of monadic logics on words, trees, pictures, and graphs
Oliver Matz, Nicole Schweikardt
Structured strategies in games on graphs
R. Ramanujam, Sunil Simon
Counting in trees
Helmut Seidl, Thomas Schwentick, Anca Muscholl
Modular quantifiers
Howard Straubing, Denis Thérien
Automata: from logics to algorithms
Moshe Y. Vardi, Thomas Wilke