We show how to obtain, via a unified framework provided by logic and aut...
We study various aspects of Dyck words appearing in binary sequences, wh...
The complement x of a binary word x is obtained by changing
each 0 in x ...
The complement x̅ of a binary word x is obtained by changing each
0 in x...
We study the properties of the ternary infinite word p =
012102101021012...
A word w is said to be closed if it has a proper factor x which occurs
e...
An overlap-free (or β-free) word w over a fixed alphabet Σ is
extremal i...
We prove an inequality for the number of periods in a word x in terms of...
A square-free word w over a fixed alphabet Σ is extremal if every
word o...
The repetition threshold for words on n letters, denoted (n), is
the inf...
For every n≥ 27, we show that the number of n/(n-1)^+-free words
(i.e., ...
We introduce a variation of the Ziv-Lempel and Crochemore factorizations...
We start by considering binary words containing the minimum possible num...