Diophantine equations, Presburger arithmetic and finite automata

DOI10.1007/3-540-61064-2_27OpenAlexW1540012118MaRDI QIDQ5878899

Alexandre Boudet, Hubert Comon

Publication date: 23 February 2023

Published in: Trees in Algebra and Programming — CAAP '96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61064-2_27

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) First-order arithmetic and fragments (03F30) Linear Diophantine equations (11D04)

Related Items (10)

On iterating linear transformations over recognizable sets of integers ⋮ Structural Presburger digit vector automata ⋮ Unnamed Item ⋮ More Than 1700 Years of Word Equations ⋮ Proving safety properties of infinite state systems by compilation into Presburger arithmetic ⋮ Automatic verification of recursive procedures with one integer parameter. ⋮ Tree languages and branched groups ⋮ Counting the solutions of Presburger equations without enumerating them. ⋮ The convex hull of a regular set of integer vectors is polyhedral and effectively computable ⋮ A class of polynomially solvable range constraints for interval analysis without widenings

Cites Work

• The computational complexity of logical theories
• An efficient incremental algorithm for solving systems of linear diophantine equations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Diophantine equations, Presburger arithmetic and finite automata