Skip to main content
SpringerLink
Log in
Book cover

International Conference on Implementation and Application of Automata

CIAA 2014: Implementation and Application of Automata pp 290–303Cite as

Pushdown Machines for Weighted Context-Free Tree Translation

  • Conference paper

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

Abstract

In this paper, we consider weighted synchronous context-free tree grammars and identify a certain syntactic restriction of these grammars. We suggest a new weighted tree transducer formalism and prove that the transformations of the restricted grammars are precisely those of the linear and nondeleting instances of these transducers.

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A.V., Ullman, J.D.: Properties of Syntax Directed Translations. J. Comput. System Sci. 3(3), 319–334 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bozapalidis, S.: Context-Free Series on Trees. Inform. and Comput. 169(2), 186–229 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  3. Büchse, M., Maletti, A., Vogler, H.: Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars. In: Yen, H.-C., Ibarra, O.H. (eds.) DLT 2012. LNCS, vol. 7410, pp. 368–379. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  4. Droste, M., Kuich, W.: Semirings and Formal Power Series. In: Kuich, W., Vogler, H., Droste, M. (eds.) Handbook of Weighted Automata, ch. 1, pp. 3–28. Springer (2009)

    Google Scholar 

  5. Engelfriet, J.: Bottom-Up and Top-Down Tree Transformations – A Comparison. Math. Systems Theory 9(2), 198–231 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  6. Engelfriet, J., Vogler, H.: Pushdown Machines for the Macro Tree Transducer. Theoret. Comput. Sci. 42(3), 251–368 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  7. Fülöp, Z., Maletti, A., Vogler, H.: Weighted Extended Tree Transducers. Fund. Inform. 111, 163–202 (2011)

    MATH  MathSciNet  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, ch. 9, pp. 313–404. Springer (2009)

    Google Scholar 

  9. Guessarian, I.: Pushdown Tree Automata. Math. Systems Theory 16(1), 237–263 (1983)

    Article  MATH  MathSciNet  Google Scholar 

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

  11. Kozen, D.: Automata and Computability. Springer (1997)

    Google Scholar 

  12. Lewis, P.M., Stearns, R.E.: Syntax-Directed Transduction. J. ACM 18(3), 465–488 (1968)

    Article  Google Scholar 

  13. Nederhof, M.J., Vogler, H.: Synchronous Context-Free Tree Grammars. In: Proc. 11th Int. Workshop Tree Adjoining Grammars and Related Formalisms, pp. 55–63 (2012)

    Google Scholar 

  14. Rounds, W.C.: Context-Free Grammars on Trees. In: Proc. 1st ACM Symp. Theory of Comput., pp. 143–148 (1969)

    Google Scholar 

  15. Rounds, W.C.: Mappings and Grammars on Trees. Theory Comput. Syst. 4(3), 257–287 (1970)

    MATH  MathSciNet  Google Scholar 

  16. Rounds, W.C.: Tree-Oriented Proofs of Some Theorems on Context-Free and Indexed Languages. In: Proc. 2nd ACM Symp. Theory of Comput., pp. 109–116 (1970)

    Google Scholar 

  17. Shieber, S.M.: Synchronous Grammars as Tree Transducers. In: Proc. 7th Int. Workshop Tree Adjoining Grammars and Related Formalisms, pp. 88–95 (2004)

    Google Scholar 

  18. Yamasaki, K.: Fundamental Properties of Pushdown Tree Transducers. IEICE Trans. Inf. & Syst. E76-D(10), 1234–1242 (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computer Science, Technische Universität Dresden, 01062, Dresden, Germany

    Johannes Osterholzer

Authors
  1. Johannes Osterholzer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität Giessen, Arndtstrasse 2, 35392, Giessen, Germany

    Markus Holzer  & Martin Kutrib  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Osterholzer, J. (2014). Pushdown Machines for Weighted Context-Free Tree Translation. In: Holzer, M., Kutrib, M. (eds) Implementation and Application of Automata. CIAA 2014. Lecture Notes in Computer Science, vol 8587. Springer, Cham. https://doi.org/10.1007/978-3-319-08846-4_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08846-4_22

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08845-7

  • Online ISBN: 978-3-319-08846-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation