Nondeterministic multicounter machines and complementation

DOI10.1016/0304-3975(89)90026-1zbMath0683.68063OpenAlexW1974506786WikidataQ126670813 ScholiaQ126670813MaRDI QIDQ1825044

Dana Pardubská, Ivana Štefáneková

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90026-1

zbMATH Keywords

counter machinescounting argumentsclosure under complement

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Cites Work

• Reversal-bounded nondeterministic multicounter machines and complementation
• On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item