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. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Héam, P. C., Nicaud, C., & Schmitz, S. (2009). Random generation of deterministic tree (walking) automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5642 LNCS, pp. 115–124). https://doi.org/10.1007/978-3-642-02979-0_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
