Reversal-Bounded Multicounter Machines and Their Decision Problems
- 1 January 1978
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 25 (1), 116-133
- https://doi.org/10.1145/322047.322058
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- Remarks on the complexity of nondeterministic counter languagesTheoretical Computer Science, 1976
- The inclusion problem for simple languagesTheoretical Computer Science, 1976
- A note on semilinear sets and bounded-reversal multihead pushdown automataInformation Processing Letters, 1974
- Reversal-bounded multipushdown machinesJournal of Computer and System Sciences, 1974
- Multi-tape and multi-head pushdown automataInformation and Control, 1968
- Counter machines and counter languagesTheory of Computing Systems, 1968
- Deterministic context free languagesInformation and Control, 1966
- On Context-Free LanguagesJournal of the ACM, 1966
- RS -Machines with Almost Blank TapeJournal of the ACM, 1964
- Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing MachinesAnnals of Mathematics, 1961