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...
Salvato in:
| Ente Autore: | |
|---|---|
| Altri autori: | |
| Natura: | Livre numérique |
| Lingua: | Anglais Français |
| Pubblicazione: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serie: | Lecture notes in computer science
386 |
| Soggetti: | |
| Accesso online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Formal properties of finite automata and applications, LITP Spring School on Theoretical Computer Science, Ramatuelle, France, May 23-27, 1988, proceedings, J.E. Pin, ed, Berlin, Springer-Verlag, 1989, 1 vol. (VIII-259 p.), Lecture notes in computer science, 0-387-51631-X • Formal Properties of Finite Automata and Applications, Texte imprimé, 9783662196939 |
Sommario:
- 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.