Translator Disclaimer
November 2004 Words and morphisms with Sturmian erasures
Fabien Durand, Adel Guerziz, Michel Koskas
Bull. Belg. Math. Soc. Simon Stevin 11(4): 575-588 (November 2004). DOI: 10.36045/bbms/1102689122

Abstract

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.

Citation

Download Citation

Fabien Durand. Adel Guerziz. Michel Koskas. "Words and morphisms with Sturmian erasures." Bull. Belg. Math. Soc. Simon Stevin 11 (4) 575 - 588, November 2004. https://doi.org/10.36045/bbms/1102689122

Information

Published: November 2004
First available in Project Euclid: 10 December 2004

zbMATH: 1074.68047
MathSciNet: MR2115726
Digital Object Identifier: 10.36045/bbms/1102689122

Subjects:
Primary: 68R15

Rights: Copyright © 2004 The Belgian Mathematical Society

JOURNAL ARTICLE
14 PAGES


SHARE
Vol.11 • No. 4 • November 2004
Back to Top