An introduction to finite automata on infinite words -- Deterministic and non ambiguous rational?-languages -- Ensembles reconnaissables de mots bi-inpinis Limite et ď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
Notes
Proceedings of the 1984 spring school
Bibliography
Includes bibliographical references and index
Notes
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. http://purl.oclc.org/DLF/benchrepro0212 MiAaHDL
digitized 2010 HathiTrust Digital Library committed to preserve pda MiAaHDL
