3 search results - page 1 / 1 » Words and morphisms with Sturmian erasures |
CORR
2008
Springer
13 years 11 months 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 ...
EJC
2008
13 years 11 months ago
2008
TCS
2008
13 years 10 months ago
2008
Recently the second two authors characterized quasiperiodic Sturmian words, proving that a Sturmian word is non-quasiperiodic if and only if it is an infinite Lyndon word. Here we...