Regular Languages meet Prefix Sorting
From MaRDI portal
Cited in
(26)- Wheeler languages
- Space efficient merging of de Bruijn graphs and Wheeler graphs
- On the complexity of recognizing Wheeler graphs
- Prefix-free regular languages and pattern matching
- Ordering regular languages and automata: complexity
- On the Hardness and Inapproximability of Recognizing Wheeler Graphs
- Order-Sorted Unification with Regular Expression Sorts.
- scientific article; zbMATH DE number 7651154 (Why is no real title available?)
- On the Complexity of String Matching for Graphs
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
- Algorithms and complexity on indexing founder graphs
- Quantum time complexity and algorithms for pattern matching on labeled graphs
- Colored constrained spanning tree on directed graphs
- Linear time construction of indexable founder block graphs
- Space-time trade-offs for the LCP array of Wheeler DFAs
- Sorting circular suffixes in linear time
- Fast pattern matching with epsilon transitions
- The rational construction of a Wheeler DFA
- Random Wheeler automata
- 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
- Improved circular dictionary matching
- Fast pattern matching with epsilon transitions
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
This page was built for publication: Regular Languages meet Prefix Sorting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146826)
