Wheeler automata were introduced in 2017 as a tool to generalize existin...
Recently, Conte et al. generalized the longest-common prefix (LCP) array...
Wheeler nondeterministic finite automata (WNFAs) were introduced as a
ge...
Verifying the robustness of machine learning models against evasion atta...
Sorting is a fundamental algorithmic pre-processing technique which ofte...
Matching statistics were introduced to solve the approximate string matc...
These are the lecture notes for the course CM0622 - Algorithms for Massi...
In the present work, we lay out a new theory showing that all automata c...
Wheeler DFAs (WDFAs) are a sub-class of finite-state automata which is
p...
We propose a new representation of the offsets of the Lempel-Ziv (LZ)
fa...
The states of a deterministic finite automaton A can be identified with
...
In the present work, we study the hierarchy of p-sortable languages:
reg...
Text indexing is a classical algorithmic problem that has been studied f...
Suppose an oracle knows a string S that is unknown to us and we want to
...
The Burrows-Wheeler-Transform (BWT), a reversible string transformation,...
An index for a finite automaton is a powerful data structure that suppor...
A compressed index is a data structure representing a text within compre...
This work introduces a companion reproducible paper with the aim of allo...
Unlike in statistical compression, where Shannon's entropy is a definiti...
We show how to build several data structures of central importance to st...
Being able to efficiently test the membership of a word in a formal lang...
We show that the Longest Common Prefix Array of a text collection of tot...
String attractors are a novel combinatorial object encompassing most kno...
Let γ be the size of a string attractor for a string S of length n
over ...
Indexing highly repetitive texts --- such as genomic databases, software...
In this paper we develop a theory describing how the extended Burrows-Wh...
The rise of repetitive datasets has lately generated a lot of interest i...
Shannon's entropy is a clear lower bound for statistical compression. Th...
We consider the problem of encoding a string of length n from an alphabe...
String attractors [STOC 2018] are combinatorial objects recently introdu...
We consider the problem of decompressing the Lempel-Ziv 77 representatio...
In this paper we give an infinite family of strings for which the length...
A well-known fact in the field of lossless text compression is that
high...