Words and morphisms with Sturmian erasures

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-611296

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.