New Decidability Results Concerning Two-Way Counter Machines
- 1 February 1995
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 24 (1) , 123-137
- https://doi.org/10.1137/s0097539792240625
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- On the equivalence of two-way pushdown automata and counter machines over bounded languagesPublished by Springer Nature ,1993
- On two-way weak counter machinesTheory of Computing Systems, 1987
- Two-Way Counter Machines and Diophantine EquationsJournal of the ACM, 1982
- Halting space-bounded computationsTheoretical Computer Science, 1980
- Simple counter machines and number-theoretic problemsJournal of Computer and System Sciences, 1979
- Reversal-Bounded Multicounter Machines and Their Decision ProblemsJournal of the ACM, 1978
- Hilbert’s tenth problem: Diophantine equations: positive aspects of a negative solutionPublished by American Mathematical Society (AMS) ,1976
- Deterministic one-counter automataJournal of Computer and System Sciences, 1975
- Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing MachinesAnnals of Mathematics, 1961