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
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Complete list of metadatas
Contributor : Jean-Michel Caricand <>
Submitted on : Thursday, February 3, 2011 - 8:40:32 AM
Last modification on : Friday, April 12, 2019 - 10:18:08 AM
Long-term archiving on : Tuesday, November 6, 2012 - 1:20:59 PM


Files produced by the author(s)


  • HAL Id : hal-00561274, version 1


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



Record views


Files downloads