Two decades ago, a breakthrough in indexing string collections made it possible to
represent them within their compressed space while at the same time offering indexed …

Automatic sequences are sequences over a finite alphabet generated by a finite-state
machine. This book presents a novel viewpoint on automatic sequences, and more …

The sensitivity of a string compression algorithm C asks how much the output size C (T) for
an input string T can increase when a single character edit operation is performed on T. This …

The notion of string attractor has recently been introduced in [Prezza, 2017] and studied in
[Kempa and Prezza, 2018] to provide a unifying framework for known dictionary-based …

The notion of string attractor has been introduced by Kempa and Prezza (STOC 2018) in the
context of Data Compression and it represents a set of positions of a finite word in which all …

Firstly studied by Kempa and Prezza in 2018 as the cement of text compression algorithms,
string attractors have become a compelling object of theoretical research within the …

We show that it is decidable, given an automatic sequence $\bf s $ and a constant $ c $,
whether all prefixes of $\bf s $ have a string attractor of size $\leq c $. Using a decision …

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

In 2020 Kutsukake et al. showed that every for every n≥ 4 the prefix of length 2 n of the
Thue-Morse word has a string attractor of size 4. In this paper we extend their result by …

In this paper, we describe string attractors of all factors of episturmian sequences and show
that their size is equal to the number of distinct letters contained in the factor.