Automata on Infinite Words : Ecole de Printemps d'Informatique Theorique, Le Mont Dore, May 14-18, 1984. 1st ed. 1985

種類:

電子ブック

責任表示:

edited by M. Nivat, D. Perrin

出版情報:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1985

著者名:

• Nivat, M.
• Perrin, D.
• SpringerLink (Online service)

シリーズ名:

Lecture Notes in Computer Science ; 192

ISBN:

9783540395058 [3540395059]    

注記:

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.

ローカル注記:

学内専用E-BOOKS (local access only)