Sequences with constant number of return words
Combinatorics
2007-09-27 v4 Discrete Mathematics
Abstract
An infinite word has the property if every factor has exactly return words. Vuillon showed that characterizes Sturmian words. We prove that a word satisfies if its complexity function is and if it contains no weak bispecial factor. These conditions are necessary for , whereas for the complexity function need not be . New examples of words satisfying are given by words related to digital expansions in real bases.
Cite
@article{arxiv.math/0608603,
title = {Sequences with constant number of return words},
author = {Lubomira Balkova and Edita Pelantova and Wolfgang Steiner},
journal= {arXiv preprint arXiv:math/0608603},
year = {2007}
}