Automata on Infinite Words Ecole de Printemps d'Informatique Theorique, Le Mont Dore, May 14-18, 1984
| Other Authors: | , |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg
Springer Berlin Heidelberg
1985, 1985
|
| Edition: | 1st ed. 1985 |
| Series: | Lecture Notes in Computer Science
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- An introduction to finite automata on infinite words
- Deterministic and non ambiguous rational ?-languages
- Ensembles reconnaissables de mots bi-inpinis Limite et déterminisme
- Automates boustrophedon sur des mots infinis
- Star-free ?-languages and first order logic
- A formal proof system for infinitary rational expressions
- Logical formulas and four subclasses of ?-regular languages
- Deterministic asynchronous automata
- Alternating automata on infinite objects, determinacy and Rabin's theorem
- The solution of two star-height problems for regular trees
- Decidability of yield's equality for infinite regular trees
- Languages and subshifts
- The adherences of languages as topological spaces
- Mots infinis en arithmetique
- Kth power-free codes
- On various classes of infinite words obtained by iterated mappings
- Overlap free words on two symbols
- Overlap-free sequences