Structural Presburger digit vector automata
The least significant digit first decomposition of integer vectors into words of digit vectors provides a natural way for representing sets of integer vectors by automata. In this paper, the minimal automata representing Presburger sets are proved structurally Presburger: automata obtained by moving the initial state and replacing the accepting condition represent Presburger sets. (C) 2008 Elsevier B.V. All rights reserved.
automaton presburger arithmetic