Automata on Infinite Words

Automata on Infinite Words
-0 %
Ecole de Printemps d'Informatique Theorique, Le Mont Dore, May 14-18, 1984
 Paperback
Print on Demand | Lieferzeit: Print on Demand - Lieferbar innerhalb von 3-5 Werktagen I

Unser bisheriger Preis:ORGPRICE: 64,19 €

Jetzt 53,48 €* Paperback

Alle Preise inkl. MwSt. | Versandkostenfrei
Artikel-Nr:
9783540156413
Veröffentl:
1985
Einband:
Paperback
Erscheinungsdatum:
01.06.1985
Seiten:
232
Autor:
D. Perrin
Gewicht:
359 g
Format:
235x155x13 mm
Serie:
192, Lecture Notes in Computer Science
Sprache:
Englisch
Beschreibung:

An introduction to finite automata on infinite words.- Deterministic and non ambiguous rational ?-languages.- Ensembles reconnaissables de mots bi-inpinis Limite et d¿rminisme.- 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.
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.

Kunden Rezensionen

Zu diesem Artikel ist noch keine Rezension vorhanden.
Helfen sie anderen Besuchern und verfassen Sie selbst eine Rezension.