-counting automata
Joël Allred, Ulrich Ultes-Nitsche (2012)
RAIRO - Theoretical Informatics and Applications
Similarity:
In this paper, we define -counting automata as recognizers for -languages, languages of infinite words. We prove that the class of -languages they recognize is a proper extension of the -regular languages. In addition we prove that languages recognized by -counting automata are closed under Boolean operations. It remains an open problem whether or not emptiness is decidable for -counting automata. However, we conjecture strongly...