Blind Counter Automata on ω-Words

摘要

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 = U_(1 ≤ i ≤ k)U_iV_i~ω, where U_i, V_i are finitary blind multicounter languages.