Format:
Online-Ressource (IV, 215 S.)
Edition:
Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
ISBN:
9783540395058
Series Statement:
Lecture notes in computer science 192
Content:
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.
Note:
Literaturangaben
Additional Edition:
ISBN 3540156410
Additional Edition:
ISBN 0387156410
Additional Edition:
ISBN 9783540156413
Additional Edition:
Erscheint auch als Druck-Ausgabe Automata on infinite words Berlin : Springer, 1985 ISBN 3540156410
Additional Edition:
ISBN 0387156410
Language:
English
Subjects:
Computer Science
,
Sociology
Keywords:
Automat
;
Unendliches Wort
;
Konferenzschrift
DOI:
10.1007/3-540-15641-0
URL:
Volltext
(lizenzpflichtig)
URL:
Volltext
(lizenzpflichtig)
URL:
Volltext
(lizenzpflichtig)
Bookmarklink
