On the solvability of a class of Diophantine equations and applications

DOI10.1016/J.TCS.2005.12.001zbMATH Open1120.11017OpenAlexW2053402117MaRDI QIDQ818150FDOQ818150

Authors: 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

Recommendations

• Diophantine equations, Presburger arithmetic and finite automata
• ON COUNTER MACHINES, REACHABILITY PROBLEMS, AND DIOPHANTINE EQUATIONS
• scientific article; zbMATH DE number 2038746
• scientific article; zbMATH DE number 4101294
• On two-way FA with monotonic counters and quadratic Diophantine equations

zbMATH Keywords

Diophantine equationscounter machine

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Higher degree equations; Fermat's equation (11D41)

Cites Work

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

Cited In (7)

• Title not available (Why is that?)
• An extension of Sophie Germain's method to a wide class of diophantine equations.
• ON COUNTER MACHINES, REACHABILITY PROBLEMS, AND DIOPHANTINE EQUATIONS
• Title not available (Why is that?)
• Reachability in Succinct and Parametric One-Counter Automata
• Title not available (Why is that?)
• The solubility of certain diophantine inequalities

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q818150)