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.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Ullman, J.D.: Properties of Syntax Directed Translations. J. Comput. System Sci. 3(3), 319–334 (1969)
Bozapalidis, S.: Context-Free Series on Trees. Inform. and Comput. 169(2), 186–229 (2001)
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)
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)
Engelfriet, J.: Bottom-Up and Top-Down Tree Transformations – A Comparison. Math. Systems Theory 9(2), 198–231 (1975)
Engelfriet, J., Vogler, H.: Pushdown Machines for the Macro Tree Transducer. Theoret. Comput. Sci. 42(3), 251–368 (1986)
Fülöp, Z., Maletti, A., Vogler, H.: Weighted Extended Tree Transducers. Fund. Inform. 111, 163–202 (2011)
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)
Guessarian, I.: Pushdown Tree Automata. Math. Systems Theory 16(1), 237–263 (1983)
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)
Kozen, D.: Automata and Computability. Springer (1997)
Lewis, P.M., Stearns, R.E.: Syntax-Directed Transduction. J. ACM 18(3), 465–488 (1968)
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)
Rounds, W.C.: Context-Free Grammars on Trees. In: Proc. 1st ACM Symp. Theory of Comput., pp. 143–148 (1969)
Rounds, W.C.: Mappings and Grammars on Trees. Theory Comput. Syst. 4(3), 257–287 (1970)
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)
Shieber, S.M.: Synchronous Grammars as Tree Transducers. In: Proc. 7th Int. Workshop Tree Adjoining Grammars and Related Formalisms, pp. 88–95 (2004)
Yamasaki, K.: Fundamental Properties of Pushdown Tree Transducers. IEICE Trans. Inf. & Syst. E76-D(10), 1234–1242 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)