Skip to main content
SpringerLink
Log in

A Backward and a Forward Simulation for Weighted Tree Automata

  • Conference paper
Algebraic Informatics (CAI 2009)

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

Included in the following conference series:

Abstract

Two types of simulations for weighted tree automata (wta) are considered. Wta process trees and assign a weight to each of them. The weights are taken from a semiring. The two types of simulations work for wta over additively idempotent, commutative semirings and can be used to reduce the size of wta while preserving their semantics. Such reductions are an important tool in automata toolkits.

This work was financially supported by the Ministerio de Educación y Ciencia (MEC)grant JDCI-2007-760.

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. Abdulla, P.A., Jonsson, B., Mahata, P., d’Orso, J.: Regular tree model checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 555–568. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Knight, K., Graehl, J.: An overview of probabilistic tree transducers for natural language processing. In: Gelbukh, A. (ed.) CICLing 2005. LNCS, vol. 3406, pp. 1–24. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  3. Hopcroft, J.E.: An n logn algorithm for minimizing states in a finite automaton. In: Theory of Machines and Computations, pp. 189–196. Academic Press, London (1971)

    Chapter  Google Scholar 

  4. Högberg, J., Maletti, A., May, J.: Backward and forward bisimulation minimization of tree automata. Theoret. Comput. Sci. (to appear, 2009), http://dx.doi.org/10.1016/j.tcs.2009.03.022

  5. Meyer, A.R., Stockmeyer, L.J.: The equivalence problem for regular expressions with squaring requires exponential space. In: Proc. FOCS, pp. 125–129. IEEE Computer Society Press, Los Alamitos (1972)

    Google Scholar 

  6. Gramlich, G., Schnitger, G.: Minimizing nFA’s and regular expressions. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 399–411. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  7. Gramlich, G., Schnitger, G.: Minimizing nfa’s and regular expressions. J. Comput. System Sci. 73(6), 908–923 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  8. Gruber, H., Holzer, M.: Inapproximability of nondeterministic state and transition complexity assuming P ≠ NP. In: Harju, T., Karhumäki, J., Lepistö, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 205–216. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  9. Abdulla, P.A., Högberg, J., Kaati, L.: Bisimulation minimization of tree automata. Int. J. Found. Comput. Sci. 18(4), 699–713 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  10. Abdulla, P.A., Bouajjani, A., Holík, L., Kaati, L., Vojnar, T.: Computing simulations over tree automata. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 93–108. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  11. Abdulla, P.A., Bouajjani, A., Holík, L., Kaati, L., Vojnar, T.: Composed bisimulation for tree automata. In: Ibarra, O.H., Ravikumar, B. (eds.) CIAA 2008. LNCS, vol. 5148, pp. 212–222. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  12. Maletti, A.: Minimizing deterministic weighted tree automata. Inform. and Comput. (to appear, 2009), http://dx.doi.org/10.1016/j.ic.2009.01.004

  13. 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 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  17. Borchardt, B.: The Theory of Recognizable Tree Series. PhD thesis, Technische Universität Dresden (2005)

    Google Scholar 

  18. Högberg, J., Maletti, A., May, J.: Bisimulation minimisation of weighted tree automata. Technical Report ISI-TR-634, University of Southern California (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departament de Filologies Romàniques, Universitat Rovira i Virgili, Avinguda de Catalunya 35, 43002, Tarragona, Spain

    Andreas Maletti

Authors
  1. Andreas Maletti
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Aristotle University of Thessaloniki, 54124, Thessaloniki, Greece

    Symeon Bozapalidis

  2. Department of Mathematics, Aristotle University of Thessaloniki, 54124, Thessaloniki, Greece

    George Rahonis

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Maletti, A. (2009). A Backward and a Forward Simulation for Weighted Tree Automata . In: Bozapalidis, S., Rahonis, G. (eds) Algebraic Informatics. CAI 2009. Lecture Notes in Computer Science, vol 5725. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03564-7_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03564-7_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03563-0

  • Online ISBN: 978-3-642-03564-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation