On two-way nondeterministic finite automata with one reversal-bounded counter
From MaRDI portal
Publication:1763701
DOI10.1016/j.tcs.2004.09.010zbMath1078.68080OpenAlexW2121428680MaRDI QIDQ1763701
Oscar H. Ibarra, Zhi-Wei Sun, Zhe Dang
Publication date: 22 February 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.09.010
Related Items (1)
Cites Work
- Unnamed Item
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- The complexity of decision problems for finite-turn multicounter machines
- Lattice translates of a polytope and the Frobenius problem
- On two-way FA with monotonic counters and quadratic Diophantine equations
- Complexity of the Frobenius problem
- Semigroups, Presburger formulas, and languages
- On the Chinese Remainder Theorem
- Two-Way Counter Machines and Diophantine Equations
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- The Diophantine Problem for Addition and Divisibility
- New Decidability Results Concerning Two-Way Counter Machines
- On a Problem of Partitions
This page was built for publication: On two-way nondeterministic finite automata with one reversal-bounded counter
