A finite word is closed if it contains a factor that occurs both as a prefix and
as a suffix but does not have internal occurrences, otherwise it is open. We are
interested in the oc-sequence of a word, which is the binary sequence whose
*n*-th …
Originally introduced and studied by the third and fourth authors together with
J. Justin and S. Widmer (2008), rich words constitute a new class of finite and
infinite words characterized by containing the maximal number of distinct …
In this paper we investigate the periodic structure of rich words (i.e., words
having the highest possible number of palindromic factors), giving new results
relating them with periodic-like words. In particular, some new
characterizations of …
In this paper, we give some new characterizations of words which are finite
factors of Sturmian words. An enumeration formula for primitive finite Sturmian
words is given. Moreover, we provide two linear-time algorithms to recognize
whether a …