On the solvability of a class of diophantine equations and applications

Theoretical Computer Science

Volumn 352, Issue 1-3, 2006, Pages 342-346

  Ibarra, Oscar H ^a   Dang, Zhe ^b  

^a University of California   (United States)

^b Washington State University   (United States)

Author keywords

Counter machine; Diophantine equation

Indexed keywords

POLYNOMIALS; PROBLEM SOLVING;

COUNTER MACHINE; DIOPHANTINE EQUATION; NONNEGATIVE INTEGERS;

INTEGRAL EQUATIONS;

EID: 32644447080     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.12.001     Document Type: Article

References (8)

1. M. Bozga, R. Iosif, Flat Parametric Counter Automata, Personal Communication, in preparation.
2. T. Harju, O.H. Ibarra, J. Karhumaki, and A. Salomaa Some decision problems concerning semilinearity and commutation J. Comput. System Sci. 65 2002 278 294
3. O.H. Ibarra, and Z. Dang On two-way FA with monotonic counters and quadratic diophantine equations Theoret. Comput. Sci. 312 2004 359 378
4. O.H. Ibarra, Z. Dang, Z.-W. Sun, Safety verification for two-way finite automata with monotonic counters, Proc. Sixth Internat. Conf.: Developments in Language Theory 2002, Lecture Notes in Computer Science, Vol. 2450, 2003, pp. 326-338.
5. O.H. Ibarra, T. Jiang, N. Tran, and H. Wang New decidability results concerning two-way counter machines SIAM J. Comput. 24 1 1995 123 137
6. L. Lipshitz The diophantine problem for addition and divisibility Trans. AMS 235 1978 271 283
7. Y.V. Matiyasevich Hilbert's Tenth Problem 1993 MIT Press Cambridge, MA
8. M. Minsky Recursive unsolvability of Post's problem of tag and other topics in the theory of turing machines Ann. Math. 74 1961 437 455