1 option
Handbook of Automata Theory [electronic resource] : Volume I. Theoretical Foundations Volume II. Automata in Mathematics and Selected Applications / Jean-Éric Pin
- Format:
- Book
- Language:
- English
- Physical Description:
- 1 online resource (1608 pages)
- Place of Publication:
- Zuerich, Switzerland : European Mathematical Society Publishing House, 2021
- System Details:
- text file PDF
- Summary:
- 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 a 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.
- Contents:
- Finite automata / Jean-Éric Pin
- Automata and rational expressions / Jacques Sakarovitch
- Finite transducers and rational transductions / Tero Harju, Juhani Karhumäki
- Weighted automata / Manfred Droste, Dietrich Kuske
- Max-plus automata / Sylvain Lombardy, Jean Mairesse
- ω-Automata / Thomas Wilke, Sven Schewe
- Automata on finite trees / Christof Löding, Wolfgang Thomas
- Automata on infinite trees / Christof Löding
- Two-dimensional models / Stefano Crespi Reghizzi, Dora Giammarresi, Violetta Lonati
- Minimisation of automata / Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot
- Learning algorithms / Henrik Björklund, Johanna Björklund, Wim Martens
- Descriptional complexity of regular languages / Hermann Gruber, Markus Holzer, Martin Kutrib
- Enumerating regular expressions and their languages / Hermann Gruber, Jonathan Lee, Jeffrey Shallit
- Circuit complexity of regular languages / Michal Koucký
- Černý's conjecture and the road colouring problem / Jarkko Kari, Mikhail V. Volkov
- Varieties / Howard Straubing, Pascal Weil
- Profinite topologies / Jorge Almeida, Alfredo Costa
- The factorisation forest theorem / Thomas Colcombet
- Wadge-Wagner hierarchies / Jacques Duparc
- Equational theories for automata / Zoltán Ésik
- Language equations / Michal Kunc, Alexander Okhotin
- Algebra for trees / Mikołaj Bojańczyk
- Rational subsets of groups / Laurent Bartholdi, Pedro Silva
- Groups defined by automata / Laurent Bartholdi, Pedro Silva
- Automata in number theory / Boris Adamczewski, Jason Bell
- On Cobham's theorem / Fabien Durand, Michel Rigo
- Symbolic dynamics / Marie-Pierre Béal, Jean Berstel, Søren Eilers, Dominique Perrin
- Automatic structures / Sasha Rubin
- Automata and finite model theory / Wouter Gelade, Thomas Schwentick
- Finite automata, image manipulation, and automatic real functions / Juhani Karhumäki, Jarkko Kari
- Communicating automata / Dietrich Kuske, Anca Muscholl
- Symbolic methods and automata / Bernard Boigelot
- Synthesis with finite automata / Igor Walukiewicz
- Timed automata / Patricia Bouyer
- Higher-order recursion schemes and their automata models / Arnaud Carayol, Olivier Serre
- Analysis of probabilistic processes and automata theory / Kousha Etessami
- Natural language parsing / Mark-Jan Nederhof, Giorgio Satta
- Verification / Javier Esparza, Orna Kupferman, Moshe Y. Vardi
- Automata and quantum computing / Andris Ambainis, Abuzer Yakaryılmaz.
- ISBN:
- 3-9854750-6-7
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.