Name
Abstract | ||
|---|---|---|
If read digit by digit, a n-dimensional vector of integers represented in base r can be viewed as a word over the alphabet r n . It has been known for some time that, under this encoding, the sets of integer vectors recognizable by finite automata are exactly those de nable in Presburger arithmetic if independence with respect to the base is required, and those de nable in a slight extension of Presburger arithmetic if only a specific base is considered. Using the same encoding idea, but moving ... |
Year | Venue | Keywords |
|---|---|---|
1998 | ICALP | integer arithmetic automata,extended abstract,presburger arithmetic,finite automata |
Field | DocType | ISBN |
Discrete mathematics,Quantum finite automata,Automata theory,Integer arithmetic,Algebra,Arbitrary-precision arithmetic,Computer science,Automaton,Presburger arithmetic,Expressivity | Conference | 3-540-64781-3 |
Citations | PageRank | References |
28 | 1.44 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bernard Boigelot | 1 | 707 | 48.59 |
| Stéphane Rassart | 2 | 51 | 2.82 |
| Pierre Wolper | 3 | 4507 | 673.68 |