Sciweavers

CORR
2008
Springer

Words and morphisms with Sturmian erasures

13 years 11 months ago
Words and morphisms with Sturmian erasures
We say x {0, 1, 2}N is a word with Sturmian erasures if for any a {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.
Fabien Durand, Adel Guerziz, Michel Koskas
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where CORR
Authors Fabien Durand, Adel Guerziz, Michel Koskas
Comments (0)