A Note on Ordinal DFAs

Stephen L. Bloom, YiDi Zhang

We prove the following theorem. Suppose that $M$ is a trim DFA on the Boolean alphabet $0,1$. The language $Ł(M)$ is well-ordered by the lexicographic order $\slex$ iff whenever th…