Generalized Wheeler automata: minimality
From MaRDI portal
Cites work
- A Myhill-Nerode theorem for generalized automata, with applications to pattern matching and compression
- An extension of the Burrows-Wheeler transform
- Co-lexicographically ordering automata and regular languages. I
- Compressing and indexing labeled trees, with applications
- Deterministic generalized automata
- Deterministic generalized automata
- Encoding co-lex orders of finite-state automata in linear space
- Fast pattern matching with epsilon transitions
- scientific article; zbMATH DE number 3751028 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- scientific article; zbMATH DE number 7788491 (Why is no real title available?)
- Improved circular dictionary matching
- Indexing compressed text
- Linear Automaton Transformations
- Optimal Wheeler language recognition
- Ordering regular languages and automata: complexity
- Prefix sorting DFAs: a recursive algorithm
- Regular Languages meet Prefix Sorting
- Sorting circular suffixes in linear time
- Sorting finite automata via partition refinement
- Space-time trade-offs for the LCP array of Wheeler DFAs
- Succinct de Bruijn graphs
- Succinct indexes for circular patterns
- Suffix Arrays: A New Method for On-Line String Searches
- Universally Wheeler languages
- Wheeler graphs: a framework for BWT-based data structures
- Wheeler languages
This page was built for publication: Generalized Wheeler automata: minimality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7356290)
