Sciweavers

TCS
2010
15 years 5 days 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 ...
WIA
2009
Springer
16 years 1 days ago
Random Generation of Deterministic Tree (Walking) 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 le...
Pierre-Cyrille Héam, Cyril Nicaud, Sylvain ...