Additional Key Words and PhrasesGraph compression; Burrows-Wheeler Transform; FM-index; FPT; Myhill-Nerode Theorem; powerset construction; Wheeler graphs

The states of a finite-state automaton can be identified with collections of words in the prefix closure of the regular language accepted by . But words can be ordered, and among the many possible orders a very natural one is the co-lexicographic …