Handbook of theoretical computer science (vol. B)
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
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
An Effective Extension of the Wagner Hierarchy to Blind Counter Automata
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Hi-index | 0.00 |
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.