|
|
|
|
| LEADER |
01912nmm a2200277 u 4500 |
| 001 |
EB000655177 |
| 003 |
EBX01000000000000001349109 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783540395058
|
| 100 |
1 |
|
|a Nivat, M.
|e [editor]
|
| 245 |
0 |
0 |
|a Automata on Infinite Words
|h Elektronische Ressource
|b Ecole de Printemps d'Informatique Theorique, Le Mont Dore, May 14-18, 1984
|c edited by M. Nivat, D. Perrin
|
| 250 |
|
|
|a 1st ed. 1985
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 1985, 1985
|
| 300 |
|
|
|a X, 222 p
|b online resource
|
| 505 |
0 |
|
|a 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
|
| 653 |
|
|
|a Formal Languages and Automata Theory
|
| 653 |
|
|
|a Machine theory
|
| 700 |
1 |
|
|a Perrin, D.
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Lecture Notes in Computer Science
|
| 028 |
5 |
0 |
|a 10.1007/3-540-15641-0
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-15641-0?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 5,131
|