Counting the solutions of Presburger equations without enumerating them.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 1538036 (Why is no real title available?)
- Diophantine equations, Presburger arithmetic and finite automata
- Handling infinite temporal data
- Location, scheduling, design and integer programming
- Logic and \(p\)-recognizable sets of integers
- On the base-dependence of sets of numbers recognizable by finite automata
- Presburgerness of predicates regular in two number systems
- Proving safety properties of infinite state systems by compilation into Presburger arithmetic
Cited in
(10)- Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization
- The convex hull of a regular set of integer vectors is polyhedral and effectively computable
- Implementation and Application of Automata
- Solving the Caesar problem without categorical sortals
- Computer Aided Verification
- scientific article; zbMATH DE number 1949644 (Why is no real title available?)
- Don't care words with an application to the automata-based approach for real addition
- Universal first-order quantification over automata
- Compiler Construction
- A generalization of Cobham's theorem to automata over real numbers
This page was built for publication: Counting the solutions of Presburger equations without enumerating them.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1426156)
