Computability by finite automata and pisot bases Academic Article uri icon

abstract

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

publication date

  • January 1, 1994