Handbook of Automata Theory


Book details

Volume I  | Volume II

Finite automata
Jean-Éric Pin
pp. 3–38
Abstract | Full-Text PDF (625 KB)

Automata and rational expressions
Jacques Sakarovitch
pp. 39–78
Abstract | Full-Text PDF (771 KB)

Finite transducers and rational transductions
Tero Harju and Juhani Karhumäki
pp. 79–111
Abstract | Full-Text PDF (470 KB)

Weighted automata
Manfred Droste and Dietrich Kuske
pp. 113–150
Abstract | Full-Text PDF (593 KB)

Max-plus automata
Sylvain Lombardy and Jean Mairesse
pp. 151–188
Abstract | Full-Text PDF (692 KB)

ω-Automata
Thomas Wilke and Sven Schewe
pp. 189–234
Abstract | Full-Text PDF (593 KB)

Automata on finite trees
Christof Löding and Wolfgang Thomas
pp. 235–264
Abstract | Full-Text PDF (439 KB)

Automata on infinite trees
Christof Löding
pp. 265–302
Abstract | Full-Text PDF (536 KB)

Two-dimensional models
Stefano Crespi Reghizzi, Dora Giammarresi and Violetta Lonati
pp. 303–333
Abstract | Full-Text PDF (488 KB)

Minimisation of automata
Jean Berstel, Luc Boasson, Olivier Carton and Isabelle Fagnot
pp. 337–373
Abstract | Full-Text PDF (727 KB)

Learning algorithms
Henrik Björklund, Johanna Björklund and Wim Martens
pp. 375–409
Abstract | Full-Text PDF (558 KB)

Descriptional complexity of regular languages
Hermann Gruber, Markus Holzer and Martin Kutrib
pp. 411–457
Abstract | Full-Text PDF (725 KB)

Enumerating regular expressions and their languages
Hermann Gruber, Jonathan Lee and Jeffrey Shallit
pp. 459–491
Abstract | Full-Text PDF (469 KB)

Circuit complexity of regular languages
Michal Koucký
pp. 493–523
Abstract | Full-Text PDF (491 KB)

Černý’s conjecture and the road colouring problem
Jarkko Kari and Mikhail V. Volkov
pp. 525–565
Abstract | Full-Text PDF (847 KB)

Varieties
Howard Straubing and Pascal Weil
pp. 569–614
Abstract | Full-Text PDF (616 KB)

Profinite topologies
Jorge Almeida and Alfredo Costa
pp. 615–652
Abstract | Full-Text PDF (595 KB)

The factorisation forest theorem
Thomas Colcombet
pp. 653–693
Abstract | Full-Text PDF (585 KB)

Wadge–Wagner hierarchies
Jacques Duparc
pp. 695–728
Abstract | Full-Text PDF (745 KB)

Equational theories for automata
Zoltán Ésik
pp. 729–764
Abstract | Full-Text PDF (564 KB)

Language equations
Michal Kunc and Alexander Okhotin
pp. 765–799
Abstract | Full-Text PDF (550 KB)

Algebra for trees
Mikołaj Bojańczyk
pp. 801–838
Abstract | Full-Text PDF (760 KB)


Volume II  | Volume I

Rational subsets of groups
Laurent Bartholdi and Pedro Silva
pp. 841–869
Abstract | Full-Text PDF (438 KB)

Groups defined by automata
Laurent Bartholdi and Pedro Silva
pp. 871–911
Abstract | Full-Text PDF (671 KB)

Automata in number theory
Boris Adamczewski and Jason Bell
pp. 913–945
Abstract | Full-Text PDF (542 KB)

On Cobham’s theorem
Fabien Durand and Michel Rigo
pp. 947–986
Abstract | Full-Text PDF (664 KB)

Symbolic dynamics
Marie-Pierre Béal, Jean Berstel, Søren Eilers and Dominique Perrin
pp. 987–1030
Abstract | Full-Text PDF (711 KB)

Automatic structures
Sasha Rubin
pp. 1031–1070
Abstract | Full-Text PDF (601 KB)

Automata and finite model theory
Wouter Gelade and Thomas Schwentick
pp. 1071–1103
Abstract | Full-Text PDF (568 KB)

Finite automata, image manipulation, and automatic real functions
Juhani Karhumäki and Jarkko Kari
pp. 1105–1143
Abstract | Full-Text PDF (925 KB)

Communicating automata
Dietrich Kuske and Anca Muscholl
pp. 1147–1188
Abstract | Full-Text PDF (589 KB)

Symbolic methods and automata
Bernard Boigelot
pp. 1189–1215
Abstract | Full-Text PDF (430 KB)

Synthesis with finite automata
Igor Walukiewicz
pp. 1217–1260
Abstract | Full-Text PDF (586 KB)

Timed automata
Patricia Bouyer
pp. 1261–1294
Abstract | Full-Text PDF (594 KB)

Higher-order recursion schemes and their automata models
Arnaud Carayol and Olivier Serre
pp. 1295–1341
Abstract | Full-Text PDF (655 KB)

Analysis of probabilistic processes and automata theory
Kousha Etessami
pp. 1343–1382
Abstract | Full-Text PDF (595 KB)

Natural language parsing
Mark-Jan Nederhof and Giorgio Satta
pp. 1383–1413
Abstract | Full-Text PDF (503 KB)

Verification
Javier Esparza, Orna Kupferman and Moshe Y. Vardi
pp. 1415–1456
Abstract | Full-Text PDF (568 KB)

Automata and quantum computing
Andris Ambainis and Abuzer Yakaryılmaz
pp. 1457–1493
Abstract | Full-Text PDF (643 KB)

BACK TO TOP