TCS
2008
13 years 4 months ago
2008
The stabilizer of an infinite word w over a finite alphabet is the monoid of morphisms over that fix w. In this paper we study various problems related to stabilizers and their g...
TCS
2008
13 years 4 months ago
2008
To any infinite word t over a finite alphabet A we can associate two infinite words min(t) and max(t) such that any prefix of min(t) (resp. max(t)) is the lexicographically smalle...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
An infinite word has the property Rm if every factor has exactly m return words. Vuillon showed that R2 characterizes Sturmian words. We prove that a word satisfies Rm if its compl...
DM
2010
13 years 4 months ago
2010
An infinite word is S-automatic if, for all n 0, its (n+1)st letter is the output of a deterministic automaton fed with the representation of n in the numeration system S. In this...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
In this paper we prove that for any infinite word w whose set of factors is closed under reversal, the following conditions are equivalent: (I) all complete returns to palindromes...