Automata on Infinite Words Ecole de Printemps d'Informatique Théorique Le Mont Dore, May 14–18, 1984 / [electronic resource] :
edited by M. Nivat, D. Perrin.
- Berlin, Heidelberg : Springer Berlin Heidelberg, 1985.
- X, 222 p. online resource.
- Lecture Notes in Computer Science, 192 0302-9743 ; .
- Lecture Notes in Computer Science, 192 .
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.
9783540395058
10.1007/3-540-15641-0 doi
Computer science.
Computer Science.
Mathematical Logic and Formal Languages.
QA8.9-QA10.3
005.131
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.
9783540395058
10.1007/3-540-15641-0 doi
Computer science.
Computer Science.
Mathematical Logic and Formal Languages.
QA8.9-QA10.3
005.131