The size b of the smallest bidirectional macro scheme, which is arguably the most general
copy-paste scheme to generate a given sequence, is considered to be the strictest …

We explore an extension to straight-line programs (SLPs) that outperforms, for some text
families, the measure δ based on substring complexity, a lower bound for most measures …

Repetitiveness measures reveal profound characteristics of datasets, and give rise to
compressed data structures and algorithms working in compressed space. Alas, the …

An L-system (for lossless compression) is a CPD0L-system extended with two parameters $
d $ and $ n $, which determines unambiguously a string $ w=\tau (\varphi^ d (s))[1: n] …

It was recently proved that any Straight-Line Program (SLP) generating a given string can be
transformed in linear time into an equivalent balanced SLP of the same asymptotic size. We …

Detecting and measuring repetitiveness of strings is a problem that has been extensively
studied in data compression and text indexing. However, when the data are structured in a …

With the advent of the new millennium, new generation technologies forced us to confront
with unpredictable challenges. To name a few contexts: collections for DNA sequencing …

The first-order theory of automatic sequences with addition is decidable, and this means that
one can often prove combinatorial properties of these sequences" automatically", using the …