Random Generation of Deterministic Tree (Walking) Automata

  • Pierre-Cyrille Héam
  • Cyril Nicaud
  • Sylvain Schmitz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5642)

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.

Keywords

Random Generation Tree Automaton Average Complexity Input Alphabet Rejection Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Wulf, M.D., Doyen, L., Henzinger, T.A., Raskin, J.F.: Antichains: A new algorithm for checking universality of finite automata. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 17–30. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  2. 2.
    van Glabbeek, R.J., Ploeger, B.: Five determinisation algorithms. In: Ibarra, O.H., Ravikumar, B. (eds.) CIAA 2008. LNCS, vol. 5148, pp. 161–170. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  3. 3.
    Schewe, S.: Büchi complementation made tight. In: [17], pp. 661–672Google Scholar
  4. 4.
    Bassino, F., David, J., Nicaud, C.: On the average complexity of Moore’s state minimization algorithm. In: [17], pp. 123–134Google Scholar
  5. 5.
    Neven, F.: Automata theory for XML researchers. SIGMOD Record 31(3), 39–46 (2002)CrossRefGoogle Scholar
  6. 6.
    Murata, M., Lee, D., Mani, M., Kawaguchi, K.: Taxonomy of XML schema languages using formal language theory. ACM Transactions on Internet Technology 5(4), 660–704 (2005)CrossRefGoogle Scholar
  7. 7.
    Engelfriet, J., Hoogeboom, H.J.: Tree-walking pebble automata. In: Karhumäki, J., Maurer, H.A., Paun, G., Rozenberg, G. (eds.) Jewels are Forever, pp. 72–83. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  8. 8.
    Bojańczyk, M., Colcombet, T.: Tree-walking automata do not recognize all regular languages. SIAM Journal on Computing 38(2), 658–701 (2008)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    ten Cate, B., Segoufin, L.: XPath, transitive closure logic, and nested tree walking automata. In: Lenzerini, M., Lembo, D. (eds.) PODS 2008, pp. 251–260 (2008)Google Scholar
  10. 10.
    Bassino, F., Nicaud, C.: Enumeration and random generation of accessible automata. Theoretical Computer Science 381(1-3), 86–104 (2007)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Bassino, F., David, J., Nicaud, C.: Enumeration and random generation of possibly incomplete deterministic automata. Pure Mathematics and Applications (2009)Google Scholar
  12. 12.
    Champarnaud, J.M., Paranthoën, T.: Random generation of DFAs. Theoretical Computer Science 330(2), 221–235 (2005)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Bassino, F., David, J., Nicaud, C.: REGAL: A library to randomly and exhaustively generate automata. In: Holub, J., Žďárek, J. (eds.) CIAA 2007. LNCS, vol. 4783, pp. 303–305. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  14. 14.
    Tabakov, D., Vardi, M.Y.: Experimental evaluation of classical automata constructions. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS, vol. 3835, pp. 396–411. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  15. 15.
    Chen, Y.F., Farzan, A., Clarke, E.M., Tsay, Y.K., Wang, B.Y.: Learning minimal separating DFA’s for compositional verification. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol. 5505. Springer, Heidelberg (2009)Google Scholar
  16. 16.
    Comon, H., Dauchet, M., Gilleron, R., Löding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (2007)Google Scholar
  17. 17.
    Albers, S., Marion, J.Y. (eds.): STACS 2009. Dagstuhl Seminar Proceedings, vol. 09001 (2009)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Pierre-Cyrille Héam
    • 1
    • 3
  • Cyril Nicaud
    • 2
  • Sylvain Schmitz
    • 3
  1. 1.LIFC, Université de Franche-Comté & INRIABesançonFrance
  2. 2.LIGM, Université Paris Est & CNRSMarne-la-ValléeFrance
  3. 3.LSV, ENS Cachan & CNRS & INRIACachanFrance

Personalised recommendations