International audienceThe 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
Automata have proved to be a useful tool in infinite-state model checking, since they can represent ...
We study the structure of automata accepting the greedy representations of N in a wide class of nume...
peer reviewedThis paper considers finite-automata based algorithms for handling linear arithmetic wi...
AbstractThe least significant digit first decomposition of integer vectors into words of digit vecto...
Les automates finis permettent de représenter symboliquement des ensembles infinis de vecteurs d'ent...
Die Presburger Arithmetik, benannt nach M. Presburger, ist die Theorie der natürlichen Zahlen mit de...
This paper introduces a finite-automata based representation of Presburger arithmetic definable set...
peer reviewedIf read digit by digit, a n-dimensional vector of integers represented in base r can b...
The Number Decision Diagram (NDD) has recently been introduced as a powerful representation system ...
peer reviewedInteruniversity Attraction Poles program MoVES; Grant 2.4530.02; ANR-06-SETI-001 AVERIS
AbstractIt has been known for a long time that the sets of integer vectors that are recognizable by ...
Abstract This work studies the properties of finite automata recogniz-ing vectors with real componen...
AbstractThis paper is a follow-up to Jan Daciuk’s experiments on space-efficient finite state automa...
This article considers finite-automata-based algorithms for handling linear arithmetic with both rea...
AbstractThis article studies the expressive power of finite-state automata recognizing sets of real ...
Automata have proved to be a useful tool in infinite-state model checking, since they can represent ...
We study the structure of automata accepting the greedy representations of N in a wide class of nume...
peer reviewedThis paper considers finite-automata based algorithms for handling linear arithmetic wi...
AbstractThe least significant digit first decomposition of integer vectors into words of digit vecto...
Les automates finis permettent de représenter symboliquement des ensembles infinis de vecteurs d'ent...
Die Presburger Arithmetik, benannt nach M. Presburger, ist die Theorie der natürlichen Zahlen mit de...
This paper introduces a finite-automata based representation of Presburger arithmetic definable set...
peer reviewedIf read digit by digit, a n-dimensional vector of integers represented in base r can b...
The Number Decision Diagram (NDD) has recently been introduced as a powerful representation system ...
peer reviewedInteruniversity Attraction Poles program MoVES; Grant 2.4530.02; ANR-06-SETI-001 AVERIS
AbstractIt has been known for a long time that the sets of integer vectors that are recognizable by ...
Abstract This work studies the properties of finite automata recogniz-ing vectors with real componen...
AbstractThis paper is a follow-up to Jan Daciuk’s experiments on space-efficient finite state automa...
This article considers finite-automata-based algorithms for handling linear arithmetic with both rea...
AbstractThis article studies the expressive power of finite-state automata recognizing sets of real ...
Automata have proved to be a useful tool in infinite-state model checking, since they can represent ...
We study the structure of automata accepting the greedy representations of N in a wide class of nume...
peer reviewedThis paper considers finite-automata based algorithms for handling linear arithmetic wi...
DOI
Add to ORKG