Daniel Berend
Senior Academic
Computability by finite automata and pisot bases
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 language | English |
| Pages | 275-282 |
| Journal | Mathematical Systems Theory |
| Volume | 27 |
| Issue number | 3 |
| Publication status | Published - 01.05.1994 |
ASJC Scopus subject areas
Theoretical Computer Science
General Mathematics
Computational Theory and Mathematics
