Counting the solutions of Presburger equations without enumerating them.

DOI10.1016/j.tcs.2003.10.002zbMath1069.68063OpenAlexW2052987729MaRDI QIDQ1426156

Louis Latour, Bernard Boigelot

Publication date: 14 March 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://orbi.ulg.ac.be/handle/2268/74856

zbMATH Keywords

AutomataPresburger arithmeticCountingSymbolic representation systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (4)

Universal first-order quantification over automata ⋮ Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization ⋮ A generalization of Cobham's theorem to automata over real numbers ⋮ Don't care words with an application to the automata-based approach for real addition

Uses Software

• LASH

Cites Work

• Unnamed Item
• Unnamed Item
• Presburgerness of predicates regular in two number systems
• Logic and \(p\)-recognizable sets of integers
• Location, scheduling, design and integer programming
• Handling infinite temporal data
• On the base-dependence of sets of numbers recognizable by finite automata
• Diophantine equations, Presburger arithmetic and finite automata
• Proving safety properties of infinite state systems by compilation into Presburger arithmetic

This page was built for publication: Counting the solutions of Presburger equations without enumerating them.