Words and repeated factors.
Carpi, Arturo, de Luca, Aldo (1999)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Carpi, Arturo, de Luca, Aldo (1999)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Petr Ambrož, Zuzana Masáková, Edita Pelantová, Christiane Frougny (2006)
Annales de l’institut Fourier
Similarity:
A simple Parry number is a real number such that the Rényi expansion of is finite, of the form . We study the palindromic structure of infinite aperiodic words that are the fixed point of a substitution associated with a simple Parry number . It is shown that the word contains infinitely many palindromes if and only if . Numbers satisfying this condition are the so-called Pisot numbers. If then is an Arnoux-Rauzy word. We show that if is a confluent Pisot number then...
Azenhas, Olga, Mamede, Ricardo (2004)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Sunic, Zoran (2007)
Journal of Integer Sequences [electronic only]
Similarity:
Štěpán Holub, Vojtěch Matocha (2013)
Kybernetika
Similarity:
We analyze an algorithm that decides whether a given word is a fixed point of a nontrivial morphism. We show that it can be implemented to have complexity in , where is the length of the word and the size of the alphabet.
Richard Thompson (1993)
Banach Center Publications
Similarity:
Makarov, M.A. (2009)
Sibirskij Matematicheskij Zhurnal
Similarity:
Bruyère, Véronique (1995)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Jalobeanu, Cireşica (2005)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
Clemens Fuchs, Robert Tijdeman (2006)
Annales de l’institut Fourier
Similarity:
In this paper we study multi-dimensional words generated by fixed points of substitutions by projecting the integer points on the corresponding broken halfline. We show for a large class of substitutions that the resulting word is the restriction of a linear function modulo and that it can be decided whether the resulting word is space filling or not. The proof uses lattices and the abstract number system associated with the substitution.