Bounds on the automata size for Presburger arithmetic

DOI10.1145/1342991.1342995zbMath1407.03053arXivcs/0506008OpenAlexW2067677333MaRDI QIDQ5277800

Felix Klaedtke

Publication date: 12 July 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0506008

zbMATH Keywords

complexityquantifier eliminationPresburger arithmeticautomata-based decision procedures

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) First-order arithmetic and fragments (03F30) Quantifier elimination, model completeness, and related topics (03C10)

Related Items (4)

Structural Presburger digit vector automata ⋮ On Presburger arithmetic extended with non-unary counting quantifiers ⋮ An approach to multicore parallelism using functional programming: a case study based on Presburger arithmetic ⋮ Ehrenfeucht-Fraïssé goes automatic for real addition

This page was built for publication: Bounds on the automata size for Presburger arithmetic