CORR
2008
Springer
15 years 19 days ago
2008
Springer
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 ...