Diophantine problems with linear recurrences via the subspace theorem.
Fuchs, Clemens (2005)
Integers
Similarity:
Fuchs, Clemens (2005)
Integers
Similarity:
David Boyd (1986)
Acta Arithmetica
Similarity:
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.
Vinh, Le Anh (2007)
Journal of Integer Sequences [electronic only]
Similarity:
Pethö, Attila (2010)
Acta Universitatis Sapientiae. Mathematica
Similarity:
Belbachir, Hacéne, Bencherif, Farid, Szalay, László (2007)
Journal of Integer Sequences [electronic only]
Similarity:
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.
Moree, Pieter (2004)
Journal of Integer Sequences [electronic only]
Similarity:
Beslin, Scott J. (1992)
International Journal of Mathematics and Mathematical Sciences
Similarity: