Tabla de Contenidos:
  • Table of Contents; Preface; Ch. 1: On the topological complexity of three languages; Ch. 2: Nondeterministic controllers of nondeterministic processes; Ch. 3: Reachability in continuous-time Markov reward decision preocesses; Ch. 4: Logical theories and compatible operations; Ch. 5: Forest algebras; Ch. 6: Automata and semigroups recognizing infinite words; Ch. 7: Deterministic graph grammars; Ch. 8: Quantifier-free definable graph operations preserving recognizability; Ch. 9: First-order definable languages; Ch. 10 : Matrix-based complexity functions and recognizable picture languages.