research
∙
06/09/2023
Space-time Trade-offs for the LCP Array of Wheeler DFAs
Recently, Conte et al. generalized the longest-common prefix (LCP) array...
share
research
∙
05/04/2023
Prefix Sorting DFAs: a Recursive Algorithm
In the past thirty years, numerous algorithms for building the suffix ar...
research
∙
01/13/2023
Computing matching statistics on Wheeler DFAs
Matching statistics were introduced to solve the approximate string matc...
research
∙
08/09/2022
Co-lexicographically ordering automata and regular languages. Part I
In the present work, we lay out a new theory showing that all automata c...
research
∙
11/08/2021
Graphs can be succinctly indexed for pattern matching in O(|E|^2 + |V|^5 / 2) time
For the first time we provide a succinct pattern matching index for arbi...
research
∙
11/03/2021
Linear-time Minimization of Wheeler DFAs
Wheeler DFAs (WDFAs) are a sub-class of finite-state automata which is p...
research
∙
06/04/2021
On (co-lex) Ordering Automata
The states of a deterministic finite automaton A can be identified with ...
research
∙
02/12/2021
Which Regular Languages can be Efficiently Indexed?
In the present work, we study the hierarchy of p-sortable languages: reg...
research
∙
07/15/2020
