Table of Contents -- Preface -- 1. On the topological complexity of tree languages -- 2. Nonederministic controllers of nondeterministic preocesses -- 3. Reachability in continuous-time Markov reward decision processes -- 4. Logical theories and compatible operations -- 5. Forest algebras -- 6. Automata and semigroups recognizing infinite words -- 7. Deterministic graph grammars -- 8. Quantifier-free definable graph opreations preserving recognizability -- 9. First-order definable languages -- 10. Matrix-based complexity functions and recognizable picture languages -- 11. Apllying Blackwell optimality: priority mean-payoff games as limits of multi-discounted games -- 12. Logic, graphs and algorithms -- 13. Non-regular fixed-points logics and games -- 14. The universal automaton -- 15. Deterministic top-down tree automata: past, present, and future -- 16. Expressive power of monadic logics on words, trees, pictures and graphs -- 17. Structured strategies in games on graphs -- 18. Counting in trees -- 19. Modular quantifiers -- 20. Automata: from logics to algorithms.