Conversion between Two Multiplicatively Dependent Linear Numeration Systems

Authors:
Christiane Frougny
Affiliations:
-
Venue:
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Year:
2002

Citing 2
Cited 0

Bertrand numeration systems and recognizability

Theoretical Computer Science - Special issue: Latin American theoretical informatics
Automata, Languages, and Machines

Automata, Languages, and Machines

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider two linear numeration systems, with characteristic polynomial equal to the minimal polynomial of two Pisot numbers 脽 and 脽 respectively, such that 脽 and 驴 are multiplicatively dependent. It is shown that the conversion between one system and the other one is computable by a finite automaton.