Random generation of unary finite automata over the domain of the regular languages : festschrift : dedicated to Derrick Kourie
Lynette van Zijl, Lesley Raitt · South African Computer Journal · 2008
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 finite automata with a small number of states. We then present a consolidated, practical method for the random generation of unary finite automata over the domain of the regular languages.