On Indexing and Compressing Finite Automata. - Nicola Cotumaccio; Nicola Prezza (SODA, 2021)

Which Regular Languages can be Efficiently Indexed? - Nicola Cotumaccio; Giovanna D'Agostino; Alberto Policriti; Nicola Prezza (CoRR, 2021)

On (co-lex) Ordering Automata. - Giovanna D'Agostino; Nicola Cotumaccio; Alberto Policriti; Nicola Prezza (CoRR, 2021)

Graphs can be succinctly indexed for pattern matching in $ O(|E|^2 + |V|^{5 / 2}) $ time. - Nicola Cotumaccio (CoRR, 2021)

Linear-time Minimization of Wheeler DFAs. - Jarno Alanko; Nicola Cotumaccio; Nicola Prezza (DCC, 2022)

Graphs can be succinctly indexed for pattern matching in $O( vert E vert ^{2}+ vert V vert ^{5/2})$ time. - Nicola Cotumaccio (DCC, 2022)

Computing matching statistics on Wheeler DFAs. - Alessio Conte; Nicola Cotumaccio; Travis Gagie; Giovanni Manzini; Nicola Prezza; Marinella Sciortino (DCC, 2023)

Prefix Sorting DFAs: A Recursive Algorithm. - Nicola Cotumaccio (ISAAC, 2023)

Space-Time Trade-Offs for the LCP Array of Wheeler DFAs. - Nicola Cotumaccio; Travis Gagie; Dominik Köppl; Nicola Prezza (SPIRE, 2023)

A Myhill-Nerode Theorem for Generalized Automata. - Nicola Cotumaccio (CoRR, 2023)

Co-lexicographically Ordering Automata and Regular Languages - Part I. - Nicola Cotumaccio; Giovanna D'Agostino; Alberto Policriti; Nicola Prezza (J. ACM, 2023)

Convex Petri Nets. - Nicola Cotumaccio; Catia Trubiani (PNSE@Petri Nets, 2024)

Computing the LCP Array of a Labeled Graph. - Jarno N. Alanko; Davide Cenzato; Nicola Cotumaccio; Sung-Hwan Kim; Giovanni Manzini; Nicola Prezza (CPM, 2024)

A Myhill-Nerode Theorem for Generalized Automata, with Applications to Pattern Matching and Compression. - Nicola Cotumaccio (STACS, 2024)

Enhanced Graph Pattern Matching. - Nicola Cotumaccio (CoRR, 2024)

On Inverting the Burrows-Wheeler Transform. - Nicola Cotumaccio (From Strings to Graphs, and Back Again, 2025)

Wheeler Graphs and Wheeler Languages. - Nicola Cotumaccio; Giovanna D'Agostino; Daniel Gibney; Alberto Policriti; Nicola Prezza; Sharma V. Thankachan (The Expanding World of Compressed Data, 2025)

Encoding Co-Lex Orders of Finite-State Automata in Linear Space. - Ruben Becker; Nicola Cotumaccio; Sung-Hwan Kim; Nicola Prezza; Carlo Tosoni (CPM, 2025)

Improved Circular Dictionary Matching. - Nicola Cotumaccio (CPM, 2025)

Fast Pattern Matching with Epsilon Transitions. - Nicola Cotumaccio (IWOCA, 2025)

Data Compression Meets Automata Theory. - Nicola Cotumaccio (Bull. EATCS, 2025)