Handbook of Automata Theory


Book details

Finite automata
Jean-Éric Pin
pp. 3–38
Abstract

Automata and rational expressions
Jacques Sakarovitch
pp. 39–78
Abstract

Finite transducers and rational transductions
Tero Harju and Juhani Karhumäki
pp. 79–111
Abstract

Weighted automata
Manfred Droste and Dietrich Kuske
pp. 113–150
Abstract

Max-plus automata
Sylvain Lombardy and Jean Mairesse
pp. 151–188
Abstract

ω-Automata
Thomas Wilke and Sven Schewe
pp. 189–234
Abstract

Automata on finite trees
Christof Löding and Wolfgang Thomas
pp. 235–264
Abstract

Automata on infinite trees
Christof Löding
pp. 265–302
Abstract

Two-dimensional models
Stefano Crespi Reghizzi, Dora Giammarresi and Violetta Lonati
pp. 303–333
Abstract

Minimisation of automata
Jean Berstel, Luc Boasson, Olivier Carton and Isabelle Fagnot
pp. 337–373
Abstract

Learning algorithms
Henrik Björklund, Johanna Björklund and Wim Martens
pp. 375–409
Abstract

Descriptional complexity of regular languages
Hermann Gruber, Markus Holzer and Martin Kutrib
pp. 411–457
Abstract

Enumerating regular expressions and their languages
Hermann Gruber, Jonathan Lee and Jeffrey Shallit
pp. 459–491
Abstract

Circuit complexity of regular languages
Michal Koucký
pp. 493–523
Abstract

Černý’s conjecture and the road colouring problem
Jarkko Kari and Mikhail V. Volkov
pp. 525–565
Abstract

Varieties
Howard Straubing and Pascal Weil
pp. 569–614
Abstract

Profinite topologies
Jorge Almeida and Alfredo Costa
pp. 615–652
Abstract

The factorisation forest theorem
Thomas Colcombet
pp. 653–693
Abstract

Wadge–Wagner hierarchies
Jacques Duparc
pp. 695–728
Abstract

Equational theories for automata
Zoltán Ésik
pp. 729–764
Abstract

Language equations
Michal Kunc and Alexander Okhotin
pp. 765–799
Abstract

Algebra for trees
Mikołaj Bojańczyk
pp. 801–838
Abstract

Rational subsets of groups
Laurent Bartholdi and Pedro Silva
pp. 841–869
Abstract

Groups defined by automata
Laurent Bartholdi and Pedro Silva
pp. 871–911
Abstract

Automata in number theory
Boris Adamczewski and Jason Bell
pp. 913–945
Abstract

On Cobham’s theorem
Fabien Durand and Michel Rigo
pp. 947–986
Abstract

Symbolic dynamics
Marie-Pierre Béal, Jean Berstel, Søren Eilers and Dominique Perrin
pp. 987–1030
Abstract

Automatic structures
Sasha Rubin
pp. 1031–1070
Abstract

Automata and finite model theory
Wouter Gelade and Thomas Schwentick
pp. 1071–1103
Abstract

Finite automata, image manipulation, and automatic real functions
Juhani Karhumäki and Jarkko Kari
pp. 1105–1143
Abstract

Communicating automata
Dietrich Kuske and Anca Muscholl
pp. 1147–1188
Abstract

Symbolic methods and automata
Bernard Boigelot
pp. 1189–1215
Abstract

Synthesis with finite automata
Igor Walukiewicz
pp. 1217–1260
Abstract

Timed automata
Patricia Bouyer
pp. 1261–1294
Abstract

Higher-order recursion schemes and their automata models
Arnaud Carayol and Olivier Serre
pp. 1295–1341
Abstract

Analysis of probabilistic processes and automata theory
Kousha Etessami
pp. 1343–1382
Abstract

Natural language parsing
Mark-Jan Nederhof and Giorgio Satta
pp. 1383–1413
Abstract

Verification
Javier Esparza, Orna Kupferman and Moshe Y. Vardi
pp. 1415–1456
Abstract

Automata and quantum computing
Andris Ambainis and Abuzer Yakaryılmaz
pp. 1457–1493
Abstract

BACK TO TOP