Following earlier work by Aldo de Luca and others, we study trapezoidal words and their prefixes, with respect to their characteristic parameters K and R (length of shortest unrepeated suffix, and shortest length without right special factors, …
Following earlier work by Aldo de Luca and others, we study trapezoidal words and their prefixes, with respect to their characteristic parameters K and R (length of shortest unrepeated suffix, and shortest length without right special factors, …
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 …
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 …
A word is closed if it contains a proper factor that occurs both as a prefix and
as a suffix but does not have internal occurrences, otherwise it is open. We
deal with the sequence of open and closed prefixes of Sturmian words and prove
that …
Trapezoidal words are words having at most $n+1$ distinct factors of length $n$
for every $n\ge 0$. They therefore encompass finite Sturmian words. We give
combinatorial characterizations of trapezoidal words and exhibit a formula for
their …