Blind counter automata on omega-words
This paper generalizes the concept of blind multicounter languages to infinite words. We introduce two different acceptance modes of blind multicounter machines on W-words, called synchrononous and asynchronous acceptance. These acceptance modes are compared with each other and with families of omega-languages of the form L = boolean OR 1 <= i <= kUiVi omega where U-i, V-i are finitary blind multicounter languages.
omega-languages blind counter machines closure properties