k-counting automata

DOI10.1051/ITA/2012021zbMATH Open1279.68126OpenAlexW2081320746MaRDI QIDQ4649452

Joel D. Allred, Ulrich Ultes-Nitsche

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

zbMATH Keywords

\(\omega \)-automataemptiness problemclosure under Boolean operationsextensions to regular \(\omega \)-languagesinfinite hierarchy of \(\omega\)-languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

This page was built for publication: k-counting automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649452)