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.

• Type: Conference
• Year: 2009
• Where: WIA
• Authors: Pierre-Cyrille Héam, Cyril Nicaud, Sylvain Schmitz
• Keywords: Artificial Intelligence, Deterministic Tree, Top-down Tree Automata, Tree Walking Automata, WIA 2009