| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437995 | Theoretical Computer Science | 2008 | 8 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
