Co-lexicographical Sorting; Deterministic Finite Automata; Graph Indexing; String Matching; Wheeler languages

Deterministic Finite Wheeler Automata are a natural generalisation to regular languages of the theory of compressed data structures originated by the introduction of the Burrows-Wheeler transform. Indeed, if we can find a Wheeler automaton …