Counter-queue Automata with an Application to a Meaningful Extension of Omega-regular Languages

In this paper, we introduce a new class of automata over infinite words (counter-queue automata) and we prove the decidability of their emptiness problem. Then, we define an original extension of ωregular languages, called ωT -regular languages, that captures meaningful languages that neither belong to the class of ω-regular languages nor to other extensions of it proposed in the literature, and we show that counter-queue automata are expressive enough to encode them.