Sciweavers

CONCUR
2010
Springer
13 years 2 months ago
On the Use of Non-deterministic Automata for Presburger Arithmetic
Abstract. A well-known decision procedure for Presburger arithmetic uses deterministic finite-state automata. While the complexity of the decision procedure for Presburger arithme...
Antoine Durand-Gasselin, Peter Habermehl