Advertisement

Construction of Tree Automata from Regular Expressions

  • Dietrich Kuske
  • Ingmar Meinecke
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5257)

Abstract

Since recognizable tree languages are closed under the rational operations, every regular tree expression denotes a recognizable tree language. We provide an alternative proof to this fact that results in smaller tree automata. To this aim, we transfer Antimirov’s partial derivatives from regular word expressions to regular tree expressions. For an analysis of the size of the resulting automaton as well as for algorithmic improvements, we also transfer the methods of Champarnaud and Ziadi from words to trees.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Antimirov, V.: Partial derivatives of regular expressions and finite automaton constructions. Theoretical Computer Science 155, 291–319 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Berry, G., Sethi, R.: From regular expressions to deterministic automata. Theoretical Computer Science 48, 117–126 (1986)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Brzozowski, J.A.: Derivatives of regular expressions. J. Assoc. Comput. Mach. 11, 481–494 (1964)zbMATHMathSciNetGoogle Scholar
  4. 4.
    Champarnaud, J.-M., Nicart, F., Ziadi, D.: Computing the follow automaton of an expression. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol. 3317, pp. 90–101. Springer, Heidelberg (2005)Google Scholar
  5. 5.
    Champarnaud, J.-M., Ziadi, D.: From c-continuations to new quadratic algorithms for automaton synthesis. Intern. J. of Algebra and Computation 11(6), 707–735 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Champarnaud, J.-M., Ziadi, D.: Canonical derivatives, partial derivatives and finite automaton constructions. Theoretical Computer Science 289, 137–163 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Comon, H., Dauchet, M., Gilleron, R., Löding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (October 2007) (release October 12, 2007), http://www.grappa.univ-lille3.fr/tata
  8. 8.
    Gécseg, F., Steinby, M.: Tree languages. In: Handbook of Formal Languages, ch. 1, vol. 3, pp. 1–68. Springer, Heidelberg (1997)Google Scholar
  9. 9.
    Glushkov, V.M.: The abstract theory of automata. Russian Mathematical Surveys 16, 1–53 (1961)CrossRefGoogle Scholar
  10. 10.
    Hosoya, H., Pierce, B.: Regular expression pattern matching for XML. SIGPLAN Not. 36(3), 67–80 (2001)CrossRefGoogle Scholar
  11. 11.
    Hromkovic, J., Seibert, S., Wilke, T.: Translating regular expressions into small ε-free nondeterministic finite automata. J. Comput. System Sci. 62, 565–588 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Ilie, L., Yu, S.: Constructing NFAs by optimal use of positions in regular expressions. In: Apostolico, A., Takeda, M. (eds.) CPM 2002. LNCS, vol. 2373, pp. 279–288. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  13. 13.
    Kleene, S.E.: Representations of events in nerve nets and finite automata. In: Shannon, C.E., McCarthy, J. (eds.) Automata Studies, pp. 3–42. Princeton University Press, Princeton (1956)Google Scholar
  14. 14.
    McNaughton, R.F., Yamada, H.: Regular expressions and state graphs for automata. IEEE Transactions on Electronic Computers 9, 39–57 (1960)CrossRefGoogle Scholar
  15. 15.
    Sakarovitch, J.: Éléments de théorie des automates. Vuibert (2003)Google Scholar
  16. 16.
    Sakarovitch, J.: The language, the expression, and the (small) automaton. In: Farré, J., Litovsky, I., Schmitz, S. (eds.) CIAA 2005. LNCS, vol. 3845, pp. 15–30. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  17. 17.
    Thatcher, J.W., Wright, J.B.: Generalized finite automata theory with application to a decision problem of second-order logic. Math. Systems Theory 2(1), 57–81 (1968)CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Dietrich Kuske
    • 1
  • Ingmar Meinecke
    • 1
  1. 1.Institut für InformatikUniversität LeipzigGermany

Personalised recommendations