Skip to main content
SpringerLink
Log in
Book cover

International Conference on Developments in Language Theory

DLT 2021: Developments in Language Theory pp 66–77Cite as

Compositions of Constant Weighted Extended Tree Transducers

  • Conference paper
  • First Online:

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

Abstract

Conjecture 11 of [Lagoutte, Maletti: Survey—Weighted extended top-down tree transducers—Part III: Composition. Proc. AFCS, LNCS 7020, p. 272–308, Springer 2011] is confirmed. It is demonstrated that the composition of a constant weighted extended tree transducer with a linear weighted top-down tree transducer can be computed by a single weighted extended tree transducer. Whereas linearity and the top-down property are syntactic, the constant property is semantic. The decidability of the constant property is investigated in several restricted settings.

This is a preview of subscription content, 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   79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   99.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

Learn about institutional subscriptions

References

  1. Allauzen, C., Riley, M., Schalkwyk, J., Skut, W., Mohri, M.: OpenFst – a general and efficient weighted finite-state transducer library. In: Proceedings of 12th International Conference Implementation and Application of Automata. Lecture Notes in Computer Science, vol. 4783, pp. 11–23. Springer (2007). https://doi.org/10.1007/978-3-540-76336-9_3

  2. Arnold, A., Dauchet, M.: Morphismes et bimorphismes d’arbres. Theor. Comput. Sci. 20(4), 33–93 (1982). https://doi.org/10.1016/0304-3975(82)90098-6

    Article  MathSciNet  MATH  Google Scholar 

  3. Dauchet, M.: Transductions inversibles de forêts. Thèse 3ème cycle, Université de Lille (1975). http://ori.univ-lille1.fr/notice/view/univ-lille1-ori-70098

  4. Engelfriet, J.: Top-down tree transducers with regular look-ahead. Math. Syst. Theory 10, 289–303 (1977). https://doi.org/10.1007/BF01683280

    Article  MathSciNet  MATH  Google Scholar 

  5. Engelfriet, J., Fülöp, Z., Vogler, H.: Bottom-up and top-down tree series transformations. J. Autom. Lang. Comb. 7(1), 11–70 (2002). https://doi.org/10.25596/jalc-2002-011

  6. Fülöp, Z., Maletti, A.: Composition closure of linear weighted extended top-down tree transducers. In: Hospodár, M., Jirásková, G. (eds.) CIAA 2019. LNCS, vol. 11601, pp. 133–145. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-23679-3_11

    Chapter  MATH  Google Scholar 

  7. Fülöp, Z., Vogler, H.: Tree series transformations that respect copying. Theory Comput. Syst. 36(3), 247–293 (2003). https://doi.org/10.1007/s00224-003-1072-z

    Article  MathSciNet  MATH  Google Scholar 

  8. Fülöp, Z., Vogler, H.: Weighted tree automata and tree transducers. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata, chap. 9, pp. 313–403. Springer (2009). https://doi.org/10.1007/978-3-642-01492-5_9

  9. Gécseg, F., Steinby, M.: Tree Automata. Akadémiai Kiadó, Budapest 2nd revision (1984). https://arxiv.org/abs/1509.06233

  10. Gécseg, F., Steinby, M.: Tree languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 1–68. Springer, Heidelberg (1997). https://doi.org/10.1007/978-3-642-59126-6_1

    Chapter  Google Scholar 

  11. Golan, J.S.: Semirings and their applications. Kluwer Acad. Publishers (1999). https://doi.org/10.1007/978-94-015-9333-5

    Article  MATH  Google Scholar 

  12. Graehl, J., Knight, K., May, J.: Training tree transducers. Comput. Linguist. 34(3), 391–427 (2008). https://doi.org/10.1162/coli.2008.07-051-R2-03-57

    Article  MathSciNet  Google Scholar 

  13. Hanneforth, T., Maletti, A., Quernheim, D.: Pushing for weighted tree automata. Logical Meth. Comput. Sci. 14(1:5), 1–16 (2018). https://doi.org/10.23638/LMCS-14(1:5)

  14. Hebisch, U., Weinert, H.J.: Semirings – algebraic theory and applications in computer science. World Sci. Publishing (1998). https://doi.org/10.1142/3903

    Article  MATH  Google Scholar 

  15. Koehn, P.: Statistical Machine Translation. Cambridge University Press (2010). https://doi.org/10.1017/CBO9780511815829

  16. Kuich, W.: Tree transducers and formal tree series. Acta Cybernetica 14(1), 135–149 (1999). https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3516

  17. Lagoutte, A., Maletti, A.: Survey: weighted extended top-down tree transducers part III — composition. In: Kuich, W., Rahonis, G. (eds.) Algebraic Foundations in Computer Science. LNCS, vol. 7020, pp. 272–308. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-24897-9_13

    Chapter  Google Scholar 

  18. Maletti, A.: Compositions of extended top-down tree transducers. Inf. Comput. 206(9–10), 1187–1196 (2008). https://doi.org/10.1016/j.ic.2008.03.019

    Article  MathSciNet  MATH  Google Scholar 

  19. Maletti, A.: Survey: weighted extended top-down tree transducers – part I: basics and expressive power. Acta Cybernetica 20(2), 223–250 (2011). https://doi.org/10.14232/actacyb.20.2.2011.2

  20. Maletti, A., Graehl, J., Hopkins, M., Knight, K.: The power of extended top-down tree transducers. SIAM J. Comput. 39(2), 410–430 (2009). https://doi.org/10.1137/070699160

    Article  MathSciNet  MATH  Google Scholar 

  21. May, J., Knight, K., Vogler, H.: Efficient inference through cascades of weighted tree transducers. In: Proceedings 48th Annual Meeting Association for Computational Linguistics, pp. 1058–1066. Association for Computational Linguistics (2010). https://www.aclweb.org/anthology/P10-1108

  22. Mohri, M., Pereira, F., Riley, M.: Weighted finite-state transducers in speech recognition. Comput. Speech Lang. 16(1), 69–88 (2002). https://doi.org/10.1006/csla.2001.0184

    Article  Google Scholar 

  23. Rounds, W.C.: Mappings and grammars on trees. Math. Syst. Theory 4(3), 257–287 (1970). https://doi.org/10.1007/BF01695769

    Article  MathSciNet  MATH  Google Scholar 

  24. Thatcher, J.W.: Generalized\(^2\) sequential machine maps. J. Comput. Syst. Sci. 4(4), 339–367 (1970). https://doi.org/10.1016/S0022-0000(70)80017-4

    Article  MathSciNet  MATH  Google Scholar 

  25. Thatcher, J.W.: Tree automata: an informal survey. In: Aho, A.V. (ed.) Currents in the Theory of Computing, chap. 4, pp. 143–172. Prentice Hall (1973)

    Google Scholar 

  26. Wang, H.: On characters of semirings. Houston J. Math. 23(3), 391–405 (1997). https://www.math.uh.edu/~hjm/restricted/archive/v023n3/0391WANG.pdf

  27. Yamada, K., Knight, K.: A decoder for syntax-based statistical MT. In: Proceedings of 40th Annual Meeting Association for Computational Linguistics, pp. 303–310. Association for Computational Linguistics (2002). https://doi.org/10.3115/1073083.1073134

Download references

Author information

Authors and Affiliations

  1. Universität Leipzig, Faculty of Mathematics and Computer Science, PO Box 100 920, 04009, Leipzig, Germany

    Malte Blattmann & Andreas Maletti

Authors
  1. Malte Blattmann
    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

Corresponding author

Correspondence to Malte Blattmann .

Editor information

Editors and Affiliations

  1. University of Porto, Porto, Portugal

    Nelma Moreira

  2. University of Porto, Porto, Portugal

    Rogério Reis

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Blattmann, M., Maletti, A. (2021). Compositions of Constant Weighted Extended Tree Transducers. In: Moreira, N., Reis, R. (eds) Developments in Language Theory. DLT 2021. Lecture Notes in Computer Science(), vol 12811. Springer, Cham. https://doi.org/10.1007/978-3-030-81508-0_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-81508-0_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-81507-3

  • Online ISBN: 978-3-030-81508-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation