Handbook of Automata Theory
Volume I: Theoretical Foundations; Volume II: Automata in Mathematics and Selected Applications
Seiten
2021
EMS Press (Verlag)
978-3-98547-006-8 (ISBN)
EMS Press (Verlag)
978-3-98547-006-8 (ISBN)
Automata theory is a subject of study at the crossroads of mathematics, theoretical computer science, and applications. In its core it deals with abstract models of systems whose behaviour is based on transitions between states, and it develops methods for the description, classification, analysis, and design of such systems.
The Handbook of Automata Theory gives a comprehensive overview of current research in automata theory, and is aimed at broad readership of researchers and graduate students in mathematics and computer science.
Volume I is divided into three parts. The first part presents various types of automata: automata on words, on infinite words, on finite and infinite trees, weighted and maxplus automata, transducers, and two-dimensional models. Complexity aspects are discussed in the second part. Algebraic and topological aspects of automata theory are covered in the third part.
Volume II consists of two parts. The first part is dedicated to applications of automata in mathematics: group theory, number theory, symbolic dynamics, logic, and real functions. The second part presents a series of further applications of automata theory such as message-passing systems, symbolic methods, synthesis, timed automata, verification of higher-order programs, analysis of probabilistic processes, natural language processing, formal verification of programs and quantum computing.
The two volumes comprise a total of thirty-nine chapters, with extensive references and individual tables of contents for each one, as well as a detailed subject index.
The Handbook of Automata Theory gives a comprehensive overview of current research in automata theory, and is aimed at broad readership of researchers and graduate students in mathematics and computer science.
Volume I is divided into three parts. The first part presents various types of automata: automata on words, on infinite words, on finite and infinite trees, weighted and maxplus automata, transducers, and two-dimensional models. Complexity aspects are discussed in the second part. Algebraic and topological aspects of automata theory are covered in the third part.
Volume II consists of two parts. The first part is dedicated to applications of automata in mathematics: group theory, number theory, symbolic dynamics, logic, and real functions. The second part presents a series of further applications of automata theory such as message-passing systems, symbolic methods, synthesis, timed automata, verification of higher-order programs, analysis of probabilistic processes, natural language processing, formal verification of programs and quantum computing.
The two volumes comprise a total of thirty-nine chapters, with extensive references and individual tables of contents for each one, as well as a detailed subject index.
Université de Paris and CNRS, France
Erscheinungsdatum | 30.09.2021 |
---|---|
Verlagsort | Berlin |
Sprache | englisch |
Maße | 165 x 235 mm |
Themenwelt | Mathematik / Informatik ► Mathematik ► Allgemeines / Lexika |
Schlagworte | Algorithmic Learning • automata on infinite words • automata on trees • automatic groups • automatic sequences • Boolean circuits • branching time logic • Church’s problem • Cobham’s theorem • communicating automata • descriptional complexity • descriptive set theory • distributed synthesis • Equational theories • Finite Automata • Finite model theory • finite transducers • forest algebras • fractal image generation • Free Groups • Hopcroft’s algorithm • infinite-state systems • language equations • Markov Decision Processes • Model-Checking • Natural Language Processing • numeration systems • picture languages • profinite topology • quantum finite automata • recursion schemes • Regular Expressions • regular languages • road colouring problem • Self-Similar Groups • Stallings automata • symbolic dynamics • synchronizing automata • synchronous automata • temporal logic • timed automata • varieties of languages • Weighted Automata |
ISBN-10 | 3-98547-006-5 / 3985470065 |
ISBN-13 | 978-3-98547-006-8 / 9783985470068 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
ein Übungsbuch für Fachhochschulen
Buch | Hardcover (2023)
Carl Hanser (Verlag)
16,99 €