We prove that the function of normalization in base θ, which maps any θ-representation of a real number onto its θ-development, obtained by a greedy algorithm, is a function computable by a finite automaton over any alphabet if and only if θ is a Pisot number.
ASJC Scopus subject areas
- Theoretical Computer Science
- Mathematics (all)
- Computational Theory and Mathematics