Nicola Cotumaccio | DeepAI

DeepAI AI Chat

Featured Co-authors

Travis Gagie
42 publications
Nicola Prezza
33 publications
Dominik Köppl
25 publications
Giovanni Manzini
20 publications
Marinella Sciortino
12 publications
Alessio Conte
9 publications
Alberto Policriti
8 publications
Jarno Alanko
4 publications
Giovanna D'Agostino
4 publications

∙ 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...

0 Nicola Cotumaccio, et al. ∙

∙ 05/04/2023

Prefix Sorting DFAs: a Recursive Algorithm

In the past thirty years, numerous algorithms for building the suffix ar...

0 Nicola Cotumaccio, et al. ∙

∙ 01/13/2023

Computing matching statistics on Wheeler DFAs

Matching statistics were introduced to solve the approximate string matc...

0 Alessio Conte, et al. ∙

∙ 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...

0 Nicola Cotumaccio, et al. ∙

∙ 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...

0 Nicola Cotumaccio, et al. ∙

∙ 11/03/2021

Linear-time Minimization of Wheeler DFAs

Wheeler DFAs (WDFAs) are a sub-class of finite-state automata which is p...

0 Jarno Alanko, et al. ∙

∙ 06/04/2021

On (co-lex) Ordering Automata

The states of a deterministic finite automaton A can be identified with ...

0 Giovanna D'Agostino, et al. ∙

∙ 02/12/2021

Which Regular Languages can be Efficiently Indexed?

In the present work, we study the hierarchy of p-sortable languages: reg...

0 Nicola Cotumaccio, et al. ∙

∙ 07/15/2020

On Indexing and Compressing Finite Automata

An index for a finite automaton is a powerful data structure that suppor...

0 Nicola Cotumaccio, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world