M. Nivat,
D. Perrin
Springer Berlin Heidelberg
1985e druk, 1985
9783540156413
Automata on Infinite Words
Ecole de Printemps d'Informatique Theorique, Le Mont Dore, May 14-18, 1984
Specificaties
Paperback, 222 blz.
|
Engels
Springer Berlin Heidelberg |
1985e druk, 1985
ISBN13: 9783540156413
Rubricering
Onderdeel van serie
Lecture Notes in Computer Science
Verwachte levertijd ongeveer 9 werkdagen
Specificaties
ISBN13:9783540156413
Taal:Engels
Bindwijze:paperback
Aantal pagina's:222
Uitgever:Springer Berlin Heidelberg
Druk:1985
Hoofdrubriek:Automatisering algemeen, Computer en informatica
Inhoudsopgave
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.

