TY  - BOOK
AU  - Nivat,M.
AU  - Perrin,D.
ED  - SpringerLink (Online service)
TI  - Automata on Infinite Words: Ecole de Printemps d'Informatique Théorique Le Mont Dore, May 14–18, 1984 
T2  - Lecture Notes in Computer Science,
SN  - 9783540395058
AV  - QA8.9-QA10.3 
U1  - 005.131 23
PY  - 1985///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
KW  - Computer science
KW  - Computer Science
KW  - Mathematical Logic and Formal Languages
N1  - 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
UR  - http://dx.doi.org/10.1007/3-540-15641-0
ER  -