Skip to main content
SpringerLink
Log in

Pushing for Weighted Tree Automata

  • Conference paper
Mathematical Foundations of Computer Science 2011 (MFCS 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6907))

Abstract

Explicit pushing for weighted tree automata over semifields is introduced. A careful selection of the pushing weights allows a normalization of bottom-up deterministic weighted tree automata. Automata in the obtained normal form can be minimized by a simple transformation into an unweighted automaton followed by unweighted minimization. This generalizes results of Mohri and Eisner for deterministic weighted string automata to the tree case. Moreover, the new strategy can also be used to test equivalence of two bottom-up deterministic weighted tree automata M 1 and M 2 in time O(|M |log|Q|), where |M | = |M 1| + |M 2| and |Q| is the sum of the number of states of M 1 and M 2. This improves the previously best running time O(|M 1|·|M 2|).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  MathSciNet  MATH  Google Scholar 

  2. Borchardt, B.: The Myhill-Nerode theorem for recognizable tree series. In: Ésik, Z., Fülöp, Z. (eds.) DLT 2003. LNCS, vol. 2710, pp. 146–158. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. Borchardt, B.: The Theory of Recognizable Tree Series. Ph.D. thesis, TU Dresden (2005)

    Google Scholar 

  4. Borchardt, B., Vogler, H.: Determinization of finite state weighted tree automata. J. Autom. Lang. Comb. 8(3), 417–463 (2003)

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  6. Bozapalidis, S., Louscou-Bozapalidou, O.: The rank of a formal tree power series. Theoret. Comput. Sci. 27(1–2), 211–215 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  7. Büchse, M., May, J., Vogler, H.: Determinization of weighted tree automata using factorizations. J. Autom. Lang. Comb. 15(3–4) (2010)

    Google Scholar 

  8. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Löding, C., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (2007), http://www.grappa.univ-lille3.fr/tata

  9. Drewes, F., Högberg, J., Maletti, A.: MAT learners for tree series — an abstract data type and two realizations. Acta Inform. 48(3), 165–189 (2011)

    Article  Google Scholar 

  10. Eisner, J.: Simpler and more general minimization for weighted finite-state automata. In: Hearst, M., Ostendorf, M. (eds.) HLT-NAACL 2003, pp. 64–71. ACL (2003)

    Google Scholar 

  11. Fülöp, Z., Vogler, H.: Weighted tree automata and tree transducers. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata. EATCS Monographs in Theoretical Computer Science, ch. 9, pp. 313–403. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  12. Gécseg, F., Steinby, M.: Tree Automata. Akadémiai Kiadó, Budapest (1984)

    Google Scholar 

  13. Gécseg, F., Steinby, M.: Tree languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, ch. 1, vol. 3, pp. 1–68. Springer, Heidelberg (1997)

    Google Scholar 

  14. Golan, J.S.: Semirings and their Applications. Kluwer Academic Publishers, Dordrecht (1999)

    MATH  Google Scholar 

  15. Hebisch, U., Weinert, H.J.: Semirings – Algebraic Theory and Applications in Computer Science. World Scientific, Singapore (1998)

    MATH  Google Scholar 

  16. Högberg, J., Maletti, A., May, J.: Bisimulation minimisation for weighted tree automata. In: Harju, T., Karhumäki, J., Lepistö, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 229–241. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  17. Högberg, J., Maletti, A., May, J.: Backward and forward bisimulation minimization of tree automata. Theoret. Comput. Sci. 410(37), 3539–3552 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  18. Kuich, W.: Formal power series over trees. In: Bozapalidis, S. (ed.) DLT 1997, pp. 61–101. Aristotle University of Thessaloniki (1998)

    Google Scholar 

  19. Maletti, A.: Minimizing deterministic weighted tree automata. Inform. Comput. 207(11), 1284–1299 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  20. May, J., Knight, K., Vogler, H.: Efficient inference through cascades of weighted tree transducers. In: Hajič, J., Carberry, S., Clark, S., Nivre, J. (eds.) ACL 2010, pp. 1058–1066. ACL (2010)

    Google Scholar 

  21. Mohri, M.: Finite-state transducers in language and speech processing. Comput. Linguist. 23(2), 269–311 (1997)

    MathSciNet  Google Scholar 

  22. Post, M., Gildea, D.: Weight pushing and binarization for fixed-grammar parsing. In: de la Clergerie, E.V., Bunt, H. (eds.) IWPT 2009, pp. 89–98. ACL (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Maschinelle Sprachverarbeitung, Universität Stuttgart, Azenbergstraße 12, 70174, Stuttgart, Germany

    Andreas Maletti & Daniel Quernheim

Authors
  1. Andreas Maletti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Daniel Quernheim
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Informatics, University of Warsaw, ul. Banacha 2, 02-097, Warsaw, Poland

    Filip Murlak  & Piotr Sankowski  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag GmbH Berlin Heidelberg

About this paper

Cite this paper

Maletti, A., Quernheim, D. (2011). Pushing for Weighted Tree Automata. In: Murlak, F., Sankowski, P. (eds) Mathematical Foundations of Computer Science 2011. MFCS 2011. Lecture Notes in Computer Science, vol 6907. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22993-0_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22993-0_42

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22992-3

  • Online ISBN: 978-3-642-22993-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation