Sturm numbers and substitution invariance of 3iet words.
Arnoux, Pierre, Berthé, Valérie, Masáková, Zuzana, Pelantová, Edita (2008)
Integers
Similarity:
Arnoux, Pierre, Berthé, Valérie, Masáková, Zuzana, Pelantová, Edita (2008)
Integers
Similarity:
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...
Marion Le Gonidec (2008)
RAIRO - Theoretical Informatics and Applications
Similarity:
In this article, we study the complexity of drunken man infinite words. We show that these infinite words, generated by a deterministic and complete countable automaton, or equivalently generated by a substitution over a countable alphabet of constant length, have complexity functions equivalent to (log ) when goes to infinity.
Baláži, Peter, Masáková, Zuzana, Pelantová, Edita (2008)
Integers
Similarity:
Doroslovački, Rade, Marković, Olivera (2000)
Novi Sad Journal of Mathematics
Similarity:
Doroslovački, Rade, Marković, Olivera (2000)
Novi Sad Journal of Mathematics
Similarity:
Louis-Sébastien Guimond, Zuzana Masáková, Edita Pelantová (2003)
Journal de théorie des nombres de Bordeaux
Similarity:
The aim of this article is to study certain combinatorial properties of infinite binary and ternary words associated to cut-and-project sequences. We consider here the cut-and-project scheme in two dimensions with general orientation of the projecting subspaces. We prove that a cut-and-project sequence arising in such a setting has always either two or three types of distances between adjacent points. A cut-and-project sequence thus determines in a natural way a symbolic sequence (infinite...
Currie, James D. (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Rampersad, Narad (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Charlier, Emilie, Rigo, Michel, Steiner, Wolfgang (2008)
Integers
Similarity: