Sorting finite automata via partition refinement

DOI10.4230/LIPICS.ESA.2023.15MaRDI QIDQ6656955zbMATH OpenFDO

Authors Ruben Becker, Manuel O. Cáceres, Davide Cenzato, SungHwan Kim, Bojana Kodric, Francisco Olivares, Nicola Prezza

Publication date 6 January 2025

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2023.15

zbMATH Keywords

graph compressionpartition refinementpattern matchingprefix sortingsortingWheeler automata

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(7)

• On the complexity of computing the co-lexicographic width of a regular language
• Computing the LCP array of a labeled graph
• A Myhill-Nerode theorem for generalized automata, with applications to pattern matching and compression
• Prefix sorting DFAs: a recursive algorithm
• Co-lexicographically ordering automata and regular languages. I
• Encoding co-lex orders of finite-state automata in linear space
• Generalized Wheeler automata: minimality

This page was built for publication: Sorting finite automata via partition refinement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6656955)