Skip to main content
SpringerLink
Log in

A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

Kleene’s theorem on the equivalence of recognizability and rationality for formal tree series over distributive multioperator monoids is proved. As a consequence of this, Kleene’s theorem for weighted tree automata over arbitrary, i.e., not necessarily commutative, semirings is derived.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Berstel, J., Reutenauer, C.: Recognizable formal power series on trees. Theor. Comput. Sci. 18(2), 115–148 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bozapalidis, S.: Equational elements in additive algebras. Theory Comput. Syst. 32(1), 1–33 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bozapalidis, S.: Context-free series on trees. Inf. Comput. 169, 186–229 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bozapalidis, S., Grammatikopoulou, A.: Recognizable picture series. J. Autom. Lang. Comb. 10, 159–183 (2005)

    MATH  MathSciNet  Google Scholar 

  5. Courcelle, B.: Equivalences and transformations of regular systems—applications to recursive program schemes and grammars. Theor. Comput. Sci. 42, 1–122 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  6. Droste, M., Gastin, P.: The Kleene-Schützenberger theorem for formal power series in partially commuting variables. Inf. Comput. 153, 47–80 (1999). Extended abstract in: 24th ICALP, LNCS, vol. 1256, pp. 682–692. Springer (1997)

    Article  MATH  MathSciNet  Google Scholar 

  7. Droste, M., Pech, C., Vogler, H.: A Kleene theorem for weighted tree automata. Theory Comput. Syst. 38, 1–38 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  8. Engelfriet, J.: Alternative Kleene theorem for weighted automata. Personal communication (2003)

  9. Engelfriet, J., Fülöp, Z., Vogler, H.: Bottom-up and top-down tree series transformations. J. Autom. Lang. Comb. 7, 11–70 (2002)

    MATH  MathSciNet  Google Scholar 

  10. Ésik, Z., Kuich, W.: Formal tree series. J. Autom. Lang. Comb. 8(2), 219–285 (2003)

    MATH  MathSciNet  Google Scholar 

  11. Fülöp, Z., Gazdag, Z., Vogler, H.: Hierarchies of tree series transformations. Theor. Comput. Sci. 314, 387–429 (2004)

    Article  MATH  Google Scholar 

  12. Fülöp, Z., Vogler, H.: Comparison of several classes of weighted tree automata. Technical report, TU Dresden (2006). TUD-FI06-08-Dez.2006

  13. Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, Part III, pp. 215–268. Springer, New York (1997)

    Google Scholar 

  14. Kleene, S.E.: Representation 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 

  15. Kuich, W.: Formal power series over trees. In: Bozapalidis, S. (ed.) 3rd International Conference on Developments in Language Theory, DLT 1997, Thessaloniki, Greece, Proceedings, pp. 61–101. Aristotle University of Thessaloniki, Thessaloniki (1998)

    Google Scholar 

  16. Kuich, W.: Linear systems of equations and automata on distributive multioperator monoids. In: Contributions to Algebra, vol. 12, pp. 1–10. Johannes Heyn (1999)

  17. Maletti, A.: Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations. Theor. Comput. Sci. 339, 200–240 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  18. Maletti, A.: Relating tree series transducers and weighted tree automata. Int. J. Found. Comput. Sci. 16(4), 723–741 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  19. Maletti, A.: Compositions of tree series transformations. Theor. Comput. Sci. 366, 248–271 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  20. Mäurer, I.: Rational and recognizable picture series. In Conference on Algebraic Informatics, Thessaloniki, April 2005

  21. Mäurer, I.: Characterizations of recognizable picture series. Theor. Comput. Sci. 374, 214–228 (2007)

    Article  Google Scholar 

  22. Ochmanski, E.: Regular behaviour of concurrent systems. Bull. Eur. Assoc. Theor. Comput. Sci. 27, 56–67 (1985)

    Google Scholar 

  23. Pech, C.: Kleene-type results for weighted tree automata. Ph.D. thesis, TU Dresden (2003)

  24. Pech, C.: Kleene’s theorem for weighted tree-automata. In: 14th International Symposium on Fundamentals of Computation Theory FCT 2003, Malmö, Sweden. Lecture Notes in Computer Science, vol. 2751, pp. 387–399. Springer, New York (2003)

    Google Scholar 

  25. Schützenberger, M.P.: On the definition of a family of automata. Inf. Control 4, 245–270 (1961)

    Article  MATH  Google Scholar 

  26. Thatcher, J.W., Wright, J.B.: Generalized finite automata theory with an application to a decision problem of second-order logic. Math. Syst. Theory 2(1), 57–81 (1968)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Szeged, Árpád tér 2., 6720, Szeged, Hungary

    Zoltán Fülöp

  2. Faculty of Computer Science, Dresden University of Technology, 01062, Dresden, Germany

    Andreas Maletti & Heiko Vogler

Authors
  1. Zoltán Fülöp
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andreas Maletti
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Heiko Vogler
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Heiko Vogler.

Additional information

This research was supported by the Hungarian Scientific Foundation (OTKA) under Grant T46686 and DAAD-MÖB and DFG GK 334/3.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fülöp, Z., Maletti, A. & Vogler, H. A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids. Theory Comput Syst 44, 455–499 (2009). https://doi.org/10.1007/s00224-007-9091-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-007-9091-9

Keywords

Search

Navigation