Automata on infinite words. Ecole de Printemps d'Informatique Théorique, Le Mont Dore, May 14-18, 1984
From MaRDI portal
Publication:1057245
zbMath0563.00019MaRDI QIDQ1057245
No author found.
Publication date: 1985
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Conference proceedings and collections of articles (00Bxx)
Related Items (9)
Systèmes codés. (Coded systems) ⋮ On the classification of computable languages ⋮ Tilings and quasiperiodicity ⋮ Algèbres effectives dans la programmation logique avec contraintes ⋮ Complete and tractable machine-independent characterizations of second-order polytime ⋮ Tilings and quasiperiodicity. ⋮ The Hausdorff-Kuratowski hierarchy of \(\omega\)-regular languages and a hierarchy of Muller automata ⋮ On automata on infinite trees ⋮ Quantum \(\omega\)-automata over infinite words and their relationships
This page was built for publication: Automata on infinite words. Ecole de Printemps d'Informatique Théorique, Le Mont Dore, May 14-18, 1984
