Characterization of substitution invariant words coding exchange of three intervals.
Baláži, Peter, Masáková, Zuzana, Pelantová, Edita (2008)
Integers
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Baláži, Peter, Masáková, Zuzana, Pelantová, Edita (2008)
Integers
Similarity:
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.
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 ...