Given an order of the underlying alphabet, we can lift it to states a finite deterministic automaton: compare use strings reaching them. When on is co-lexicographic one and this turns out be total, DFA called Wheeler. This recently introduced class automata—the Wheeler automata—constitute important data-structure for languages, since allows design implementation very efficient tool-set storage ...