Automata on infinite words
Author(s)
Bibliographic Information
Automata on infinite words
(Lecture notes in computer science, 192)
Springer-Verlag, c1985
- : gw
- : us
Available at / 54 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
L/N||LNCS||19285033324
-
University of Tsukuba Library, Library on Library and Information Science
Germany007.08:L-49:192881003950,851009130
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographies and index
Description and Table of Contents
Table of Contents
An introduction to finite automata on infinite words.- Deterministic and non ambiguous rational ?-languages.- Ensembles reconnaissables de mots bi-inpinis Limite et determinisme.- 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.
by "Nielsen BookData"