Skip to Main content Skip to Navigation
Journal articles

Parametric Random Generation of Deterministic Tree Automata

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 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

Cited literature [18 references]  Display  Hide  Download
Contributor : Jean-Michel Caricand <>
Submitted on : Wednesday, May 23, 2018 - 5:09:41 PM
Last modification on : Thursday, July 2, 2020 - 5:26:02 PM
Document(s) archivé(s) le : Friday, August 24, 2018 - 10:31:38 PM


Files produced by the author(s)



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



Record views


Files downloads