Random automata and path generation in Vcsn



This report presents the implementation of an efficient and generic way to generate random weighted automata. To do so, we use a previously established relations between some known sets and the set of accessible DFA with n states. By extending these relations to the weighted case, we generalize the presented algorithm and we show an implementation in the Vcsn platform.