Automata on Infinite Words: Ecole de Printemps d'Informatique Théorique Le Mont Dore, May 14–18, 1984 [1 ed.] 3540156410, 9783540156413 [DJVU]

Table of contents :
An introduction to finite automata on infinite words....Pages 1-17
Deterministic and non ambiguous rational ω-languages....Pages 18-27
Ensembles reconnaissables de mots bi-inpinis Limite et déterminisme....Pages 28-46
Automates boustrophedon sur des mots infinis....Pages 47-54
Star-free ω-languages and first order logic....Pages 55-67
A formal proof system for infinitary rational expressions....Pages 68-80
Logical formulas and four subclasses of ω-regular languages....Pages 81-88
Deterministic asynchronous automata....Pages 89-98
Alternating automata on infinite objects, determinacy and Rabin's theorem....Pages 99-107
The solution of two star-height problems for regular trees....Pages 108-117
Decidability of yield's equality for infinite regular trees....Pages 118-136
Languages and subshifts....Pages 137-146
The adherences of languages as topological spaces....Pages 147-163
Mots infinis en arithmetique....Pages 164-171
Kth power-free codes....Pages 172-187
On various classes of infinite words obtained by iterated mappings....Pages 188-197
Overlap free words on two symbols....Pages 198-206
Overlap-free sequences....Pages 207-215