Parametric Random Generation of Deterministic Tree Automata

Pierre-Cyrille Heam (1) , Cyril Nicaud (2) , Sylvain Schmitz (3)

1 CASSIS - Combination of approaches to the security of infinite states systems
2 LIGM - Laboratoire d'Informatique Gaspard-Monge
3 LSV - Laboratoire Spécification et Vérification [Cachan]

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 letter-to-letter transducers up to isomorphism. We also propose an original parametric random generation algorithm to produce sequential letter-to-letter transducers with a fixed number of transitions. We tailor this general scheme to randomly generate deterministic tree walking automata and deterministic top-down tree automata. We apply our implementation of the generator to the estimation of the average complexity of a deterministic tree walking automata to nondeterministic top-down tree automata construction we also implemented.

Mots clés: Random generation; Average complexity; Tree automaton

Domaines: Génie logiciel [cs.SE]; Modélisation et simulation

Pierre-Cyrille Heam, Cyril Nicaud, Sylvain Schmitz. Parametric Random Generation of Deterministic Tree Automata. Theoretical Computer Science, 2010, 411 (1), pp.3469--3480. ⟨10.1016/j.tcs.2010.05.036⟩. ⟨hal-00561274⟩