Combinatorics on words aims at finding deep connections between properties of
sequences. The resulting theoretical findings are often used in the design of efficient …

A closed string is a string with a proper substring that occurs in the string as a prefix and a
suffix, but not elsewhere. Closed strings were introduced by Fici (2011) as objects of …

Trapezoidal words are words having at most n+ 1 distinct factors of length n for every n≥ 0.
They therefore encompass finite Sturmian words. We give combinatorial characterizations of …

A closed word (aka periodic-like word or complete first return) is a word whose longest
border does not have internal occurrences, or, equivalently, whose longest repeated prefix …

We tackle the problems of computing the rightmost variant of the Lempel-Ziv factorizations in
the online/sliding model. Previous best bounds for this problem are O (n log n) time with O …

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 …

We say a finite word $ x $ is a palindromic periodicity if there exist two palindromes $ p $
and $ s $ such that $| x|\geq| ps| $ and $ x $ is a prefix of the word $(ps)^\omega …

A word $ w $ has a border $ u $ if $ u $ is a non-empty proper prefix and suffix of $ u $. A
word $ w $ is said to be\emph {closed} if $ w $ is of length at most $1 $ or if $ w $ has a …

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. We show that any word of length n contains at least n+ …

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 …