Words and morphisms with Sturmian erasures
Durand, Fabien ; Guerziz, Adel ; Koskas, Michel
Bull. Belg. Math. Soc. Simon Stevin, Tome 11 (2004) no. 1, p. 575-588 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
We say $x \in \{ 0,1,2 \}^{\mathbb{N}}$ is a word with Sturmian erasures if for any $a\in \{ 0,1,2 \}$ the word obtained erasing all $a$ in $x$ is a Sturmian word. A large family of such words is given coding trajectories of balls in the game of billiards in the cube. We prove that the monoid of morphisms mapping all words with Sturmian erasures to words with Sturmian erasures is not finitely generated.
Publié le : 2004-12-14
Classification:  Words with Sturmian erasures,  Sturmian words,  Sturmian morphisms,  68R15 
@article{1102689122,
     author = {Durand, Fabien and Guerziz, Adel and Koskas, Michel},
     title = {Words and morphisms with Sturmian erasures},
     journal = {Bull. Belg. Math. Soc. Simon Stevin},
     volume = {11},
     number = {1},
     year = {2004},
     pages = { 575-588},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1102689122}
}

Durand, Fabien; Guerziz, Adel; Koskas, Michel. Words and morphisms with Sturmian erasures. Bull. Belg. Math. Soc. Simon Stevin, Tome 11 (2004) no. 1, pp.  575-588. http://gdmltest.u-ga.fr/item/1102689122/