Reversal-bounded nondeterministic multicounter machines and complementation
From MaRDI portal
Publication:1094884
DOI10.1016/0304-3975(87)90040-5zbMath0631.68069OpenAlexW2053405063MaRDI QIDQ1094884
Publication date: 1987
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(87)90040-5
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- One-way simple multihead finite automata are not closed under concatenation
- Remarks on blind and partially blind one-way multicounter machines
- 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
- Unnamed Item
- Unnamed Item
This page was built for publication: Reversal-bounded nondeterministic multicounter machines and complementation