ON COUNTER MACHINES, REACHABILITY PROBLEMS, AND DIOPHANTINE EQUATIONS
Óscar H. Ibarra, Zhe Dang, Linmin Yang · International Journal of Foundations of Computer Science · 2008
We give a brief survey of results that use “reversal-bounded counters” in studying reachability problems for various classes of transition systems. We also discuss the connection between the decidability of reachability in counter machines and the solvability of certain Diophantine equations.