Autorenfreundlich Bücher kaufen?!
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.
Ecole de Printemps d'Informatique Theorique, Le Mont Dore, May 14-18, 1984
Details
| Verlag | Springer Berlin |
| Ersterscheinung | 01. Juni 1985 |
| Maße | 23.5 cm x 15.5 cm |
| Gewicht | 359 Gramm |
| Format | Softcover |
| ISBN-13 | 9783540156413 |
| Seiten | 222 |