Sciweavers

Share
CORR
2006
Springer

Sequences with constant number of return words

8 years 5 months ago
Sequences with constant number of return words
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 complexity function is (m-1)n+1 and if it contains no weak bispecial factor. These conditions
Lubomíra Balková, Edita Pelantov&aac
Added 11 Dec 2010
Updated 11 Dec 2010
Type Journal
Year 2006
Where CORR
Authors Lubomíra Balková, Edita Pelantová, Wolfgang Steiner
Comments (0)
books