Sciweavers

TCS
2010
13 years 5 months ago
Parametric random generation of deterministic tree automata
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential l...
Pierre-Cyrille Héam, Cyril Nicaud, Sylvain ...