On the Uniform Random Generation of Determinisitic Partially Ordered Automata using Monte Carlo Techniques
Pierre‐Cyrille Héam, Joly, Jean-Luc · INRIA a CCSD electronic archive server · 2014
Partially ordered automata are finite automata admitting no simple loops of length greater than or equal to 2. In this paper we show how to randomly and uniformly generate deterministic accessible partially ordered automata using Monte-Carlo techniques.