Automata on Infinite Words

Ecole de Printemps d'Informatique Theorique, Le Mont Dore, May 14-18, 1984

232 Seiten, Taschenbuch

Kurzbeschreibung des Verlags

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.

• Reihe: Lecture Notes in Computer Science
• Themen: Informatik und Informationstechnologie Informatik Theoretische Informatik
• ISBN: 9783540156413
• Sprache: Englisch
• Erscheinungsdatum: 01.06.1985
• Größe: 235 x 155 mm
• Verlag: Springer
• Herausgegeben von: M. Nivat, D. Perrin