Displaying similar documents to “A note on linear recurrent Mahler numbers.”

On multiplicatively dependent linear numeration systems, and periodic points

Christiane Frougny (2002)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

Two linear numeration systems, with characteristic polynomial equal to the minimal polynomial of two Pisot numbers β and γ respectively, such that β and γ are multiplicatively dependent, are considered. It is shown that the conversion between one system and the other one is computable by a finite automaton. We also define a sequence of integers which is equal to the number of periodic points of a sofic dynamical system associated with some Parry number.

D0L sequence equivalence is in P for fixed alphabets

Keijo Ruohonen (2008)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

A new algorithm is presented for the D0L sequence equivalence problem which, when the alphabets are fixed, works in time polynomial in the rest of the input data. The algorithm uses a polynomial encoding of words and certain well-known properties of -rational sequences.

Elementary sequences.

Beslin, Scott J. (1992)

International Journal of Mathematics and Mathematical Sciences

Similarity: