Mathematics – Combinatorics
Scientific paper
2008-01-03
Bulletin of the Belgian Mathematical Society 11, 4 (2004) 575-588
Mathematics
Combinatorics
Scientific paper
We say $x \in \{0,1,2 \}^{\NN}$ 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.
Durand Fabien
Guerziz Adel
Koskas Michel
No associations
LandOfFree
Words and morphisms with Sturmian erasures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Words and morphisms with Sturmian erasures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Words and morphisms with Sturmian erasures will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-611296