COMPUTABILITY BY FINITE AUTOMATA AND PISOT BASES

Authors
BEREND D FROUGNY C
Citation
D. Berend et C. Frougny, COMPUTABILITY BY FINITE AUTOMATA AND PISOT BASES, Mathematical systems theory, 27(3), 1994, pp. 275-282
Citations number
9
Categorie Soggetti
System Science","Mathematics, Pure","Computer Science Theory & Methods",Mathematics
Journal title
Mathematical systems theory → ACNP
ISSN journal
00255661
Volume
27
Issue
3
Year of publication
1994
Pages
275 - 282
Database
ISI
SICI code
0025-5661(1994)27:3<275:CBFAAP>2.0.ZU;2-#
Abstract
We prove that the function of normalization in base theta, which maps any theta-representation of a real number onto its theta-development, obtained by a greedy algorithm, is a function computable by a finite a utomaton over any alphabet if and only if theta is a Pisot number.