Formal Properties of Finite Automata and Applications 1988: Ramatuelle, France

Jean-Eric Pin (Ed.): Formal Properties of Finite Automata and Applications, LITP Spring School on Theoretical Computer Science, Ramatuelle, France, May 25-29, 1987, Proceedings. Lecture Notes in Computer Science 386 Springer 1989, ISBN 3-540-51631-X

Mathematical foundations of the theory of automata

Jean Berstel:
Finite automata and rational languages. An introduction. 2-14
Howard Straubing:
The wreath product and its applications. 15-24
Marcel Paul Schützenberger:
Décomposition polynomiale des fonctions rationnelles (English summary). 25-33
Jean-Eric Pin:
Relational morphisms, transductions and operations on languages. 34-55
Jean-Camille Birget:
Basic techniques for two-way finite automata. 56-64
Imre Simon:
Properties of factorization forests. 65-72

Problems related to the theory of automata

Kosaburo Hashiguchi:
Relative star height, star height and finite automata with distance functions. 74-88
John C. Meakin:
Automata and the word problem. 89-103
Wolfgang Thomas:
Automata and quantifier hierarchies. 104-119
Pascal Weil:
Concatenation product: a survey. 120-137
Aldo de Luca, Stefano Varricchio:
A finiteness condition for semigroups. 138-147
Jorge Almeida:
Equations for pseudovarieties. 148-164

Applications of the theory of automata

Maxime Crochemore:
Algorithms and automata. 166-175
G. Rauzy:
Numbers and automata. 176-185
Antonio Restivo:
Codes and Automata. 186-198
Howard Straubing, Denis Thérien:
Finite automata and computational complexity. 199-233
Irène Guessarian:
A characterization of fair computations of finite state SCCS processes. 234-248
Didier Vergamini:
Verification of distributed systems: an experiment. 249-259

Last update Fri May 25 08:25:30 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page