Automata on infinite words
Wedi'i Gadw mewn:
| Awdur Corfforaethol: | |
|---|---|
| Awduron Eraill: | , |
| Fformat: | Livre numérique |
| Iaith: | Anglais Français |
| Cyhoeddwyd: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Cyfres: | Lecture notes in computer science
192 |
| Pynciau: | |
| Mynediad Ar-lein: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nodyn: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Automata on infinite words, Ecole de printemps d'informatique théorique, Le Mont Dore, May 14-18, 1984, 1985, Berlin, Springer, 1 vol. (IV-215 p.), Lecture notes in computer science, 3-540-15641-0 • Automata on Infinite Words, Texte imprimé, 9783662207819 |
Tabl Cynhwysion:
- 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.