Logic and Automata
History and Perspectives
Published on 29. November 2007
Book
Paperback/Softback
736 pages
978-90-5356-576-6 (ISBN)
Description
Mathematical logic and automata theory are two scientific disciplines with a fundamentally close relationship. The authors of Logic and Automata take the occasion of the sixtieth birthday of Wolfgang Thomas to present a tour d'horizon of automata theory and logic. The twenty papers in this volume cover many different facets of logic and automata theory, emphasizing the connections to other disciplines such as games, algorithms, and semigroup theory, as well as discussing current challenges in the field.
Reviews / Votes
"Mathematical logic and automata theory are basic to the theory of computation, and for the verification and synthesis of computing systems. This comprehensive volume gives a grand view of the field and its connections to complexity theory, algorithms, and games." Professor Bernhard von Stengel, London School of EconomicsMore details
Series
Language
English
Place of publication
Amsterdam
Netherlands
Target group
College/higher education
Professional and scholarly
Dimensions
Height: 234 mm
Width: 156 mm
Weight
1108 gr
ISBN-13
978-90-5356-576-6 (9789053565766)
DOI
10.5117/9789053565766
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Persons
Erich Graedel is professor of mathematical logic at the University of Aachen. Joerg Flum is professor of mathematical logic at the University of Freiberg. Thomas Wilke is professor of computer science at the University of Kiel.
Content
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