  We consider the problem of enumerating a regular language $L$ in radix order,
or more precisely, the equivalent problem of enumerating all words in $L$ of a
given length in lexicographic order. Ackerman and Shallit gave in 2009 the
principles of an efficient solution to this problem, but they did not use the
enumeration complexity framework for their analysis. We adapt their work into
an explicit algorithm that fits this framework.
