Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages

For a formal language L, the problem of language enumeration asks to compute the length-lexicographically smallest word in L larger than a given input w ∈ Σ∗ (henceforth called the L-successor of w...