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.

[1]  Frédérique Bassino,et al.  On the Average Complexity of Moore's State Minimization Algorithm , 2009, STACS.

[2]  Borivoj Melichar,et al.  Finding Common Motifs with Gaps Using Finite Automata , 2006, CIAA.

[3]  Frédérique Bassino,et al.  Enumeration and random generation of accessible automata , 2007, Theor. Comput. Sci..

[4]  Sven Schewe,et al.  Büchi complementation made tight , 2009, STACS.

[5]  Frédérique Bassino,et al.  Enumeration and random generation of possibly incomplete deterministic automata. , 2008 .

[6]  Balder ten Cate,et al.  XPath, transitive closure logic, and nested tree walking automata , 2008, PODS.

[7]  Thomas Colcombet,et al.  Tree-Walking Automata Do Not Recognize All Regular Languages , 2008, SIAM J. Comput..

[8]  Moshe Y. Vardi,et al.  Experimental Evaluation of Classical Automata Constructions , 2005, LPAR.

[9]  Frank Wolter,et al.  Monodic fragments of first-order temporal logics: 2000-2001 A.D , 2001, LPAR.

[10]  Hubert Comon,et al.  Tree automata techniques and applications , 1997 .

[11]  Murali Mani,et al.  Taxonomy of XML schema languages using formal language theory , 2005, TOIT.

[12]  Orna Kupferman,et al.  Büchi Complementation Made Tighter , 2006, Int. J. Found. Comput. Sci..

[13]  Thomas A. Henzinger,et al.  Antichains: A New Algorithm for Checking Universality of Finite Automata , 2006, CAV.

[14]  Haruo Hosoya,et al.  Multi-Return Macro Tree Transducers , 2008, PLAN-X.

[15]  Yih-Kuen Tsay,et al.  Learning Minimal Separating DFA's for Compositional Verification , 2009, TACAS.

[16]  Rob J. van Glabbeek,et al.  Five Determinisation Algorithms , 2008, CIAA.

[17]  Jean-Marc Champarnaud,et al.  Random generation of DFAs , 2005, Theor. Comput. Sci..

[18]  Thomas Colcombet,et al.  Tree-walking automata do not recognize all regular languages , 2005, STOC '05.

[19]  G. Paun,et al.  Jewels are Forever , 1999, Springer Berlin Heidelberg.

[20]  Frank Neven,et al.  Automata theory for XML researchers , 2002, SGMD.

[21]  Frédérique Bassino,et al.  : A Library to Randomly and Exhaustively Generate Automata , 2007, CIAA.

[22]  Joost Engelfriet,et al.  Tree-Walking Pebble Automata , 1999, Jewels are Forever.