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...

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science 2008-12, Vol.409 (3), p.549-556
Main Author: Leroux, Jérôme
Format: Article
Language:English
Subjects:
Applied sciences
Automaton
Computer Science
Computer science
control theory
systems
Data Structures and Algorithms
Exact sciences and technology
Language theory and syntactical analysis
Miscellaneous
Presburger arithmetic
Theoretical computing
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2008.09.037