Computability by finite automata and pisot bases

Daniel Berend, Christiane Frougny

Research output: Contribution to journalArticlepeer-review

20 Scopus citations

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.

Original languageEnglish
Pages (from-to)275-282
Number of pages8
JournalMathematical Systems Theory
Volume27
Issue number3
DOIs
StatePublished - 1 May 1994

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Mathematics (all)
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'Computability by finite automata and pisot bases'. Together they form a unique fingerprint.

Cite this