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