Random Generation of Deterministic Tree (Walking) Automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

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 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.
Fichier principal
Vignette du fichier
RandomTA.pdf (191.57 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00408316 , version 1 (30-07-2009)



Pierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz. Random Generation of Deterministic Tree (Walking) Automata. 14th International Conference on Implementation and Application of Automata - CIAA 2009, Jul 2009, Sydney, Australia. pp.115--124, ⟨10.1007/978-3-642-02979-0_15⟩. ⟨inria-00408316⟩
319 View
121 Download



Gmail Facebook Twitter LinkedIn More