| Issue |
RAIRO-Theor. Inf. Appl.
Volume 46, Number 4, October-December 2012
Special Issue: Non-Classical Models of Automata and Applications III (NCMA-2011)
|
|
|---|---|---|
| Page(s) | 461 - 478 | |
| DOI | https://doi.org/10.1051/ita/2012021 | |
| Published online | 10 October 2012 | |
k-counting automata
Department of Computer Science, University of Fribourg, Boulevard de Pérolles
90, 1700 Fribourg, Switzerland,
joel.allred@unifr.ch, uun@unifr.ch.
Received:
9
November
2011
Accepted:
13
June
2012
In this paper, we define k-counting automata as recognizers for ω-languages, i.e. 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 k-counting automata are closed under Boolean operations. It remains an open problem whether or not emptiness is decidable for k-counting automata. However, we conjecture strongly that it is decidable and give formal reasons why we believe so.
Mathematics Subject Classification: 68Q45 / 20F10
Key words: ω-automata / extensions to regularω-languages / closure under Boolean operations / emptiness problem / infinite hierarchy ofω-languages
© EDP Sciences 2012
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.