Formal Properties of Finite Automata and Applications: LITP Spring School on Theoretical Computer Science, Ramatuelle, France, May 23-27, 1988. Proceedings
Jean-Éric Pin, Ecole de printemps d'informatique théorique · Medical Entomology and Zoology · 1989
Finite automata and rational languages an introduction.- The wreath product and its applications.- Polynomial decomposition of rational functions / Decomposition polynomiale des fonctions rationnelles.- Relational morphisms, transductions and operations on languages.- Basic techniques for two-way finite automata.- Properties of factorization forests.- Relative star height, star height and finite automata with distance functions.- Automata and the word problem.- Automata and quantifier hierarchies.- Concatenation product: a survey.- A finiteness condition for semigroups.- Equations for pseudovarieties.- Algorithms and automata.- Numbers and automata.- Codes and automata.- Finite automata and computational complexity.- A characterization of fair computations of finite state SCCS processes.- Verification of distributed systems: An experiment.