Combinatorics, Automata and Number Theory 2010
DOI: 10.1017/cbo9780511777653.003
|View full text |Cite
|
Sign up to set email alerts
|

Number representation and finite automata

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
40
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 38 publications
(40 citation statements)
references
References 27 publications
(30 reference statements)
0
40
0
Order By: Relevance
“…The question of renormalisation (or change of alphabet) is motivated by performing arithmetic operations. In [148,149], Frougny shows among other things that renormalisation is computable by a finite transducer in the case of a G-scale given by a linear recurrence sequence (G-scales are introduced and discussed in Section 5). These survey papers develop the theory of β-representation from the point of view of automata theory.…”
Section: Annales De L'institut Fouriermentioning
confidence: 99%
See 1 more Smart Citation
“…The question of renormalisation (or change of alphabet) is motivated by performing arithmetic operations. In [148,149], Frougny shows among other things that renormalisation is computable by a finite transducer in the case of a G-scale given by a linear recurrence sequence (G-scales are introduced and discussed in Section 5). These survey papers develop the theory of β-representation from the point of view of automata theory.…”
Section: Annales De L'institut Fouriermentioning
confidence: 99%
“…An extensively studied question is to find the characterisation of these β (see Section 4). More generally, for detailed surveys on the β-numeration, see for instance [69,74,242,148,304]. …”
Section: Annales De L'institut Fouriermentioning
confidence: 99%
“…We refer to [15] [16], Chapter 7 in [26], [33] [35] for the numeration in Pisot base, and to [20] [24] [28] [29] [30] [32] [41] [42] for an introduction to mathematical quasicrystals (to Delone sets, Meyer sets ...).…”
Section: Definitions and Notationsmentioning
confidence: 99%
“…The aim of this paper is first to recall the part of this program specifically devoted to the notions of sets of beta-integers ( Z β ), when β is a quadratic Pisot-Vijayaraghavan number, and associated beta-lattices (or β-lattices), and next to present some original results concerning the Fourier properties and diffraction spectra of Delone sets on beta-integers and on beta-lattices, and more generally of weighted Dirac combs supported by beta-lattices. This approach makes prominent the role played by nonclassical numerations [16] [26], associated with substitutive dynamical systems [34], and amounts to replace the traditional set of rational integers Z by Z β . This allows computations over this new set of numbers, where lattices are replaced by beta-lattices.…”
mentioning
confidence: 99%
“…, a d−1 . Numeration based on linear recurrent scales have been studied in [14][15][16][17][18][19][20] with respect to the representability of the addition-by-one map by a finite automaton. In the context of linear recursive base sequences the case when the characteristic polynomial…”
mentioning
confidence: 99%