UID:
edoccha_9959186097702883
Format:
1 online resource (X, 222 p.)
Edition:
1st ed. 1985.
Edition:
Online edition Springer Lecture Notes Archive ; 041142-5
ISBN:
3-540-39505-9
Series Statement:
Lecture Notes in Computer Science, 192
Note:
Bibliographic Level Mode of Issuance: Monograph
,
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.
,
English
In:
Springer eBooks
Additional Edition:
ISBN 3-540-15641-0
Language:
English
DOI:
10.1007/3-540-15641-0
URL:
http://dx.doi.org/10.1007/3-540-15641-0
