k-counting automata
From MaRDI portal
Publication:4649452
DOI10.1051/ita/2012021zbMath1279.68126MaRDI QIDQ4649452
Ulrich Ultes-Nitsche, Joel D. Allred
Publication date: 22 November 2012
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ita/2012021
\(\omega \)-automata; emptiness problem; closure under Boolean operations; extensions to regular \(\omega \)-languages; infinite hierarchy of \(\omega\)-languages
68Q45: Formal languages and automata
20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)