default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHandbook of Automata Theory, 2021
- Jean-Éric Pin:
Handbook of Automata Theory. European Mathematical Society Publishing House, Zürich, Switzerland 2021, ISBN 978-3-98547-006-8
Volume I. Theoretical Foundations
- Jean-Éric Pin:
Finite automata. 3-38 - Jacques Sakarovitch:
Automata and rational expressions. 39-78 - Tero Harju
, Juhani Karhumäki:
Finite transducers and rational transductions. 79-111 - Manfred Droste, Dietrich Kuske:
Weighted automata. 113-150 - Sylvain Lombardy, Jean Mairesse:
Max-plus automata. 151-188 - Thomas Wilke, Sven Schewe:
ω-Automata. 189-234 - Christof Löding, Wolfgang Thomas:
Automata on finite trees. 235-264 - Christof Löding:
Automata on infinite trees. 265-302 - Stefano Crespi-Reghizzi, Dora Giammarresi, Violetta Lonati:
Two-dimensional models. 303-333 - Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot:
Minimisation of automata. 337-373 - Henrik Björklund, Johanna Björklund, Wim Martens:
Learning algorithms. 375-409 - Hermann Gruber, Markus Holzer, Martin Kutrib:
Descriptional complexity of regular languages. 411-457 - Hermann Gruber, Jonathan Lee, Jeffrey O. Shallit:
Enumerating regular expressions and their languages. 459-491 - Michal Koucký:
Circuit complexity of regular languages. 493-523 - Jarkko Kari, Mikhail V. Volkov:
Cerný's conjecture and the road colouring problem. 525-565 - Howard Straubing, Pascal Weil:
Varieties. 569-614 - Jorge Almeida, Alfredo Costa:
Profinite topologies. 615-652 - Thomas Colcombet:
The factorisation forest theorem. 653-693 - Jacques Duparc:
Wadge-Wagner hierarchies. 695-728 - Zoltán Ésik:
Equational theories for automata. 729-764 - Michal Kunc, Alexander Okhotin:
Language equations. 765-799 - Mikolaj Bojanczyk:
Algebra for trees. 801-838
Volume II. Automata in Mathematics and Selected Applications
- Laurent Bartholdi, Pedro V. Silva:
Rational subsets of groups. 841-869 - Laurent Bartholdi, Pedro V. Silva:
Groups defined by automata. 871-911 - Boris Adamczewski, Jason Bell:
Automata in number theory. 913-945 - Fabien Durand, Michel Rigo:
On Cobham's theorem. 947-986 - Marie-Pierre Béal, Jean Berstel, Søren Eilers, Dominique Perrin:
Symbolic dynamics. 987-1030 - Sasha Rubin:
Automatic structures. 1031-1070 - Wouter Gelade, Thomas Schwentick:
Automata and finite model theory. 1071-1103 - Juhani Karhumäki, Jarkko Kari:
Finite automata, image manipulation, and automatic real functions. 1105-1143 - Dietrich Kuske, Anca Muscholl:
Communicating automata. 1147-1188 - Bernard Boigelot:
Symbolic methods and automata. 1189-1215 - Igor Walukiewicz:
Synthesis with finite automata. 1217-1260 - Patricia Bouyer:
Timed automata. 1261-1294 - Arnaud Carayol, Olivier Serre:
Higher-order recursion schemes and their automata models. 1295-1341 - Kousha Etessami:
Analysis of probabilistic processes and automata theory. 1343-1382 - Mark-Jan Nederhof, Giorgio Satta:
Natural language parsing. 1383-1413 - Javier Esparza, Orna Kupferman, Moshe Y. Vardi:
Verification. 1415-1456 - Andris Ambainis, Abuzer Yakaryilmaz:
Automata and quantum computing. 1457-1493
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-03-01 15:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
