---

＜電子ブック＞
Automata on Infinite Words : Ecole de Printemps d'Informatique Theorique, Le Mont Dore, May 14-18, 1984 / edited by M. Nivat, D. Perrin
(Lecture Notes in Computer Science. ISSN:16113349 ; 192)

版	1st ed. 1985.
出版者	(Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
出版年	1985
本文言語	英語
大きさ	X, 222 p : online resource
著者標目	Nivat, M editor Perrin, D editor SpringerLink (Online service)
件　名	LCSH:Machine theory FREE:Formal Languages and Automata Theory
一般注記	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 HTTP:URL=https://doi.org/10.1007/3-540-15641-0

 類似資料