Blind Counter Automata on ω-Words

Authors:
Henning Fernau;Ralf Stiebe
Affiliations:
Fachbereich IV, Abteilung Informatik, Universität Trier, D-54286 Trier, Germany. E-mail: fernau@uni-trier.de;Fakultät für Informatik, Otto-von-Guericke-Universität Magdeburg PF-4120, D-39016 Magdeburg, Germany. E-mail: stiebe@iws.cs.uni-magdeburg.de
Venue:
Fundamenta Informaticae
Year:
2008

Citing 10
Cited 0

Automata on infinite objects

Handbook of theoretical computer science (vol. B)
X-automata on &ohgr;-words

Theoretical Computer Science
Kolmogorov complexity and Hausdorff dimension

Information and Computation
Computer science and the fine structure of Borel sets

Theoretical Computer Science
Iterated function systems and control languages

Information and Computation
Handbook of Formal Languages

Handbook of Formal Languages
Sequential grammars and automata with valances

Theoretical Computer Science
Valuations and Unambiguity of Languages, with Applications to Fractal Geometry

ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Valuated and Valence Grammars: An Algebraic View

DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper generalizes the concept of blind multicounter languages to infinite words. We introduce two different acceptance modes of blind multicounter machines on ω-words, called synchrononous and asynchronous acceptance. These acceptance modes are compared with each other and with families of ω-languages of the form L = ∪$_{1⩽i⩽k}$U$_i$V$^ω_i$, where U$_i$, V$_i$ are finitary blind multicounter languages.