On the solvability of a class of Diophantine equations and applications

DOI10.1016/j.tcs.2005.12.001zbMath1120.11017OpenAlexW2053402117MaRDI QIDQ818150

Oscar H. Ibarra, Zhe Dang

Publication date: 24 March 2006

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.12.001

zbMATH Keywords

Diophantine equationscounter machine

Mathematics Subject Classification ID

Related Items (2)

Reachability in Succinct and Parametric One-Counter Automata ⋮ ON COUNTER MACHINES, REACHABILITY PROBLEMS, AND DIOPHANTINE EQUATIONS

Cites Work

• Unnamed Item
• Unnamed Item
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Some decision problems concerning semilinearity and commutation.
• On two-way FA with monotonic counters and quadratic Diophantine equations
• The Diophantine Problem for Addition and Divisibility
• New Decidability Results Concerning Two-Way Counter Machines
• Flat Parametric Counter Automata

This page was built for publication: On the solvability of a class of Diophantine equations and applications