Random generator of accessible automata with a unique initiale state. Each transition (p,a,q) is drawn with a probability p/n, where n is the number of states in the automaton and p a constant value given by the user. The algorithm returns the accessible part of the produced automaton. A trick using information on the distribution of size of the accessible part allows to generate a bigger automaton guaranting that the average size of the accessible part is the one the user asked for.
Author(s): Julien David