Structural Presburger digit vector automata

Jérôme Leroux (1, 2)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique
2 VERTECS - Verification models and techniques applied to testing and control of reactive systems

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.

Mots clés: Automaton; Presburger arithmetic

Domaines: Algorithme et structure de données [cs.DS]

Jérôme Leroux. Structural Presburger digit vector automata. Theoretical Computer Science, 2008, 409 (3), pp.549-556. ⟨10.1016/j.tcs.2008.09.037⟩. ⟨hal-00345971⟩