Abstract:
We show that the standard methods for the random
generation of finite automata are inadequate if considered over the domain of the regular languages, for small n. We then present a consolidated, practical method for the random generation of unary finite automata
over the domain of the regular languages.
