Blind Counter Automata on ω-Words
Henning Fernau, Ralf Stiebe · Fundamenta Informaticae · 2008
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 = ∪$_{1lilk}$U$_i$V$^ω_i$, where U$_i$, V$_i$ are finitary blind multicounter languages.