Blind Counter Automata on ω-Words

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.