Displaying similar documents to “Characterization of substitution invariant words coding exchange of three intervals.”

Morphisms fixing words associated with exchange of three intervals

Petr Ambrož, Zuzana Masáková, Edita Pelantová (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We consider words coding exchange of three intervals with permutation (3,2,1), here called 3iet words. Recently, a characterization of substitution invariant 3iet words was provided. We study the opposite question: what are the morphisms fixing a 3iet word? We reveal a narrow connection of such morphisms and morphisms fixing Sturmian words using the new notion of amicability.

On substitution invariant Sturmian words: an application of Rauzy fractals

Valérie Berthé, Hiromi Ei, Shunji Ito, Hui Rao (2007)

RAIRO - Theoretical Informatics and Applications

Similarity:

Sturmian words are infinite words that have exactly factors of length for every positive integer . A Sturmian word is also defined as a coding over a two-letter alphabet of the orbit of point under the action of the irrational rotation (mod 1). A substitution fixes a Sturmian word if and only if it is invertible. The main object of the present paper is to investigate Rauzy fractals associated with two-letter invertible substitutions. As an application, we give an alternative ...

Combinatorial properties of infinite words associated with cut-and-project sequences

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...

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...