Parametric Random Generation of Deterministic Tree Automata

Pierre Héam (1) , Cyril Nicaud (2) , Sylvain Schmitz (3)

1 FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174)
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 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: Average complexity; Tree automaton; Random generation

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

Pierre Héam, Cyril Nicaud, Sylvain Schmitz. Parametric Random Generation of Deterministic Tree Automata. Theoretical Computer Science, 2010, 411, pp.3469-3480. ⟨10.1016/j.tcs.2010.05.036⟩. ⟨hal-01226599⟩