{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:00:15Z","timestamp":1725796815153},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319088457"},{"type":"electronic","value":"9783319088464"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08846-4_22","type":"book-chapter","created":{"date-parts":[[2014,7,4]],"date-time":"2014-07-04T07:56:43Z","timestamp":1404460603000},"page":"290-303","source":"Crossref","is-referenced-by-count":1,"title":["Pushdown Machines for Weighted Context-Free Tree Translation"],"prefix":"10.1007","author":[{"given":"Johannes","family":"Osterholzer","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"22_CR1","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/S0022-0000(69)80018-8","volume":"3","author":"A.V. Aho","year":"1969","unstructured":"Aho, A.V., Ullman, J.D.: Properties of Syntax Directed Translations. J. Comput. System Sci.\u00a03(3), 319\u2013334 (1969)","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"22_CR2","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1006\/inco.2001.2890","volume":"169","author":"S. Bozapalidis","year":"2001","unstructured":"Bozapalidis, S.: Context-Free Series on Trees. Inform. and Comput.\u00a0169(2), 186\u2013229 (2001)","journal-title":"Inform. and Comput."},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-642-31653-1_33","volume-title":"Developments in Language Theory","author":"M. B\u00fcchse","year":"2012","unstructured":"B\u00fcchse, 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.\u00a07410, pp. 368\u2013379. Springer, Heidelberg (2012)"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"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\u201328. Springer (2009)","DOI":"10.1007\/978-3-642-01492-5_1"},{"issue":"2","key":"22_CR5","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/BF01704020","volume":"9","author":"J. Engelfriet","year":"1975","unstructured":"Engelfriet, J.: Bottom-Up and Top-Down Tree Transformations \u2013 A Comparison. Math. Systems Theory\u00a09(2), 198\u2013231 (1975)","journal-title":"Math. Systems Theory"},{"issue":"3","key":"22_CR6","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0304-3975(86)90052-6","volume":"42","author":"J. Engelfriet","year":"1986","unstructured":"Engelfriet, J., Vogler, H.: Pushdown Machines for the Macro Tree Transducer. Theoret. Comput. Sci.\u00a042(3), 251\u2013368 (1986)","journal-title":"Theoret. Comput. Sci."},{"key":"22_CR7","doi-asserted-by":"crossref","first-page":"163","DOI":"10.3233\/FI-2011-559","volume":"111","author":"Z. F\u00fcl\u00f6p","year":"2011","unstructured":"F\u00fcl\u00f6p, Z., Maletti, A., Vogler, H.: Weighted Extended Tree Transducers. Fund. Inform.\u00a0111, 163\u2013202 (2011)","journal-title":"Fund. Inform."},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"F\u00fcl\u00f6p, 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\u2013404. Springer (2009)","DOI":"10.1007\/978-3-642-01492-5_9"},{"issue":"1","key":"22_CR9","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF01744582","volume":"16","author":"I. Guessarian","year":"1983","unstructured":"Guessarian, I.: Pushdown Tree Automata. Math. Systems Theory\u00a016(1), 237\u2013263 (1983)","journal-title":"Math. Systems Theory"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30586-6_1","volume-title":"Computational Linguistics and Intelligent Text Processing","author":"K. Knight","year":"2005","unstructured":"Knight, K., Graehl, J.: An Overview of Probabilistic Tree Transducers for Natural Language Processing. In: Gelbukh, A. (ed.) CICLing 2005. LNCS, vol.\u00a03406, pp. 1\u201324. Springer, Heidelberg (2005)"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Kozen, D.: Automata and Computability. Springer (1997)","DOI":"10.1007\/978-1-4612-1844-9"},{"issue":"3","key":"22_CR12","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1145\/321466.321477","volume":"18","author":"P.M. Lewis","year":"1968","unstructured":"Lewis, P.M., Stearns, R.E.: Syntax-Directed Transduction. J. ACM\u00a018(3), 465\u2013488 (1968)","journal-title":"J. ACM"},{"key":"22_CR13","unstructured":"Nederhof, M.J., Vogler, H.: Synchronous Context-Free Tree Grammars. In: Proc. 11th Int. Workshop Tree Adjoining Grammars and Related Formalisms, pp. 55\u201363 (2012)"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Rounds, W.C.: Context-Free Grammars on Trees. In: Proc. 1st ACM Symp. Theory of Comput., pp. 143\u2013148 (1969)","DOI":"10.1145\/800169.805428"},{"issue":"3","key":"22_CR15","first-page":"257","volume":"4","author":"W.C. Rounds","year":"1970","unstructured":"Rounds, W.C.: Mappings and Grammars on Trees. Theory Comput. Syst.\u00a04(3), 257\u2013287 (1970)","journal-title":"Theory Comput. Syst."},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"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\u2013116 (1970)","DOI":"10.1145\/800161.805156"},{"key":"22_CR17","unstructured":"Shieber, S.M.: Synchronous Grammars as Tree Transducers. In: Proc. 7th Int. Workshop Tree Adjoining Grammars and Related Formalisms, pp. 88\u201395 (2004)"},{"key":"22_CR18","unstructured":"Yamasaki, K.: Fundamental Properties of Pushdown Tree Transducers. IEICE Trans. Inf. & Syst. E76-D(10), 1234\u20131242 (1993)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08846-4_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,21]],"date-time":"2020-08-21T20:09:01Z","timestamp":1598040541000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08846-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319088457","9783319088464"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08846-4_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}