Subclasses of Presburger arithmetic and the polynomial-time hierarchy
Theoretical Computer Science
Mixed real-integer linear quantifier elimination
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Journal of the ACM (JACM)
A decision procedure for term algebras with queues
ACM Transactions on Computational Logic (TOCL)
Representing Arithmetic Constraints with Finite Automata: An Overview
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Deciding Presburger Arithmetic by Model Checking and Comparisons with Other Methods
FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract)
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract)
SAS '95 Proceedings of the Second International Symposium on Static Analysis
A Comparison of Presburger Engines for EFSM Reachability
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Automatic Presentations of Structures
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
Diophantine Equations, Presburger Arithmetic and Finite Automata
CAAP '96 Proceedings of the 21st International Colloquium on Trees in Algebra and Programming
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Presburger arithmetic with bounded quantifier alternation
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Presburger''s Article on Integer Arithmetic: Remarks and Translation
Presburger''s Article on Integer Arithmetic: Remarks and Translation
The complexity of translating logic to finite automata
Automata logics, and infinite games
An effective decision procedure for linear arithmetic over the integers and reals
ACM Transactions on Computational Logic (TOCL)
Upper bounds for a theory of queues
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Action language verifier, extended
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Ehrenfeucht--Fraïssé goes automatic for real addition
Information and Computation
On the use of non-deterministic automata for presburger arithmetic
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Presburger arithmetic, rational generating functions, and quasi-polynomials
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Hi-index | 0.00 |
Automata provide a decision procedure for Presburger arithmetic. However, until now only crude lower and upper bounds were known on the sizes of the automata produced by the automata-based approach for Presburger arithmetic. In this article, we give an upper bound on the number of states of the minimal deterministic automaton for a Presburger arithmetic formula. This bound depends on the length of the formula and the quantifiers occurring in it. We establish the upper bound by comparing the automata for Presburger arithmetic formulas with the formulas produced by a quantifier-elimination method. We show that our bound is tight, also for nondeterministic automata. Moreover, we provide automata constructions for atomic formulas and establish lower bounds for the automata for linear equations and inequations.