Diophantine equations, Presburger arithmetic and finite automata

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

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

Recommendations

• Components of \(V(\rho)\otimes V(\rho)\)
• A note on branching of \(V( \rho )\)
• scientific article; zbMATH DE number 66791
• An algebraic proof of the PRV conjecture for very regular weights.
• scientific article; zbMATH DE number 3865525

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An efficient incremental algorithm for solving systems of linear diophantine equations
• The computational complexity of logical theories
• Title not available (Why is that?)

Cited In (22)

• Quadratic word equations with length constraints, counter systems, and Presburger arithmetic with divisibility
• Title not available (Why is that?)
• A class of polynomially solvable range constraints for interval analysis without widenings
• Automatic verification of recursive procedures with one integer parameter.
• On iterating linear transformations over recognizable sets of integers
• ON COUNTER MACHINES, REACHABILITY PROBLEMS, AND DIOPHANTINE EQUATIONS
• Proving safety properties of infinite state systems by compilation into Presburger arithmetic
• On the use of non-deterministic automata for Presburger arithmetic
• Tree languages and branched groups
• Behavior decompositions and two-sided diophantine equations
• Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems
• Structural Presburger digit vector automata
• More than 1700 years of word equations
• Bounds on the automata size for Presburger arithmetic
• Counting the solutions of Presburger equations without enumerating them.
• Compiler Construction
• Title not available (Why is that?)
• Reasoning About Regular Properties: A Comparative Study
• The convex hull of a regular set of integer vectors is polyhedral and effectively computable
• A note on branching of \(V( \rho )\)
• Components of \(V(\rho)\otimes V(\rho)\)
• On the solvability of a class of Diophantine equations and applications

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

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