| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Random Generation of Deterministic Tree (Walking) 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.
Cited literature [15 references]
https://hal.inria.fr/inria-00408316
Contributor : Sylvain Schmitz <>
Submitted on : Thursday, July 30, 2009 - 11:34:37 AM
Last modification on : Monday, February 15, 2021 - 10:39:05 AM
Long-term archiving on: : Monday, October 15, 2012 - 3:41:44 PM
Contributor : Sylvain Schmitz <>
Submitted on : Thursday, July 30, 2009 - 11:34:37 AM
Last modification on : Monday, February 15, 2021 - 10:39:05 AM
Long-term archiving on: : Monday, October 15, 2012 - 3:41:44 PM
File
RandomTA.pdf
Files produced by the author(s)