Formal Properties of Finite Automata and Applications LITP Spring School on Theoretical Computer Science, Ramatuelle, France, May 23-27, 1988. Proceedings
The volume contains the proceedings of the 16th Spring School on Theoretical Computer Science held in Ramatuelle, France, in May 1988. It is a unique combination of research level articles on various aspects of the theory of finite automata and its applications. Advances made in the last five years...
Other Authors: | |
---|---|
Format: | eBook |
Language: | English |
Published: |
Berlin, Heidelberg
Springer Berlin Heidelberg
1989, 1989
|
Edition: | 1st ed. 1989 |
Series: | Lecture Notes in Computer Science
|
Subjects: | |
Online Access: | |
Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- 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