Uniform Sampling for Networks of Automata * †

Nicolas Basset, Jean Mairesse, Michèle Soria
We call network of automata a family of partially synchronised automata, i.e. a family of determin-istic automata which are synchronised via shared letters, and evolve independently otherwise. We address the problem of uniform random sampling of words recognised by a network of automata. To that purpose, we define the reduced automaton of the model, which involves only the product of the synchronised part of the component automata. We provide uniform sampling algorithms which are polynomial
more » ... respect to the size of the reduced automaton, greatly improving on the best known algorithms. Our sampling algorithms rely on combinatorial and probabilistic methods and are of three different types: exact, Boltzmann and Parry sampling.