Displaying similar documents to “Factor complexity of infinite words associated with non-simple Parry numbers.”

Look and Say Fibonacci

Patrice Séébold (2008)

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

Similarity:

The L S (Look and Say) derivative of a word is obtained by writing the number of consecutive equal letters when the word is spelled from left to right. For example, L S ( 1 1 2 3 3 ) = 2 1 1 2 2 3 (two 1 , one 2 , two 3 ). We start the study of the behaviour of binary words generated by morphisms under the L S operator, focusing in particular on the Fibonacci word.

Sturmian jungle (or garden?) on multiliteral alphabets

L'ubomíra Balková, Edita Pelantová, Štěpán Starosta (2010)

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

Similarity:

The properties characterizing sturmian words are considered for words on multiliteral alphabets. We summarize various generalizations of sturmian words to multiliteral alphabets and enlarge the list of known relationships among these generalizations. We provide a new equivalent definition of rich words and make use of it in the study of generalizations of sturmian words based on palindromes. We also collect many examples of infinite words to illustrate differences in the generalized...