Prefix sorting DFAs: a recursive algorithm
From MaRDI portal
Cites work
- Algorithms on Strings, Trees and Sequences
- Co-lexicographically ordering automata and regular languages. I
- Combinatorial Pattern Matching
- Compressed suffix trees with full functionality
- Compressing and indexing labeled trees, with applications
- Constructing suffix arrays in linear time
- Faster prefix-sorting algorithms for deterministic finite automata
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
- scientific article; zbMATH DE number 7788491 (Why is no real title available?)
- Indexing compressed text
- Linear work suffix array construction
- On the Complexity of String Matching for Graphs
- Prefix sorting DFAs: a recursive algorithm
- Regular Languages meet Prefix Sorting
- Sorting finite automata via partition refinement
- Space efficient linear time construction of suffix arrays
- Succinct de Bruijn graphs
- Suffix Arrays: A New Method for On-Line String Searches
- Three Partition Refinement Algorithms
- Wheeler graphs: a framework for BWT-based data structures
Cited in
(9)- On the complexity of computing the co-lexicographic width of a regular language
- Sorting circular suffixes in linear time
- Fast pattern matching with epsilon transitions
- 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
- Fast pattern matching with epsilon transitions
This page was built for publication: Prefix sorting DFAs: a recursive algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6953198)
