Sciweavers

WIA
2009
Springer
14 years 5 months 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 ...