{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:49:21Z","timestamp":1743065361106,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476659"},{"type":"electronic","value":"9783662476666"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47666-6_17","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T07:46:47Z","timestamp":1434700007000},"page":"209-221","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Decision Problems of Tree Transducers with Origin"],"prefix":"10.1007","author":[{"given":"Emmanuel","family":"Filiot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Maneth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre-Alain","family":"Reynier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Marc","family":"Talbot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"issue":"1\u20132","key":"17_CR1","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0304-3975(97)00080-7","volume":"205","author":"Y Andre","year":"1998","unstructured":"Andre, Y., Bossut, F.: On the equivalence problem for letter-to-letter top-down tree transducers. Theor. Comput. Sci. 205(1\u20132), 207\u2013229 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-642-40313-2_15","volume-title":"Mathematical Foundations of Computer Science 2013","author":"M Benedikt","year":"2013","unstructured":"Benedikt, M., Engelfriet, J., Maneth, S.: Determinacy and rewriting of top-down and MSO tree transformations. In: Chatterjee, K., Sgall, J. (eds.) MFCS 2013. LNCS, vol. 8087, pp. 146\u2013158. Springer, Heidelberg (2013)"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/978-3-662-43951-7_3","volume-title":"Automata, Languages, and Programming","author":"M Boja\u0144czyk","year":"2014","unstructured":"Boja\u0144czyk, M.: Transducers with origin information. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014, Part II. LNCS, vol. 8573, pp. 26\u201337. Springer, Heidelberg (2014)"},{"key":"17_CR4","unstructured":"Braune, F., Seemann, N., Quernheim, D., Maletti, A.: Shallow local multi-bottom-up tree transducers in statistical machine translation. In: ACL, pp. 811\u2013821 (2013)"},{"key":"17_CR5","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., L\u00f6ding, C., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007)"},{"issue":"1","key":"17_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2715","volume":"145","author":"F Drewes","year":"1998","unstructured":"Drewes, F., Engelfriet, J.: Decidability of the finiteness of ranges of tree transductions. Inf. Comput. 145(1), 1\u201350 (1998)","journal-title":"Inf. Comput."},{"key":"17_CR7","volume-title":"Formal language theory; perspectives and open problems","author":"J Engelfriet","year":"1980","unstructured":"Engelfriet, J.: Some open questions and recent results on tree transducers and tree languages. In: Book, R. (ed.) Formal language theory; perspectives and open problems. Academic Press, New York (1980)"},{"issue":"1","key":"17_CR8","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1006\/inco.1999.2807","volume":"154","author":"J Engelfriet","year":"1999","unstructured":"Engelfriet, J., Maneth, S.: Macro tree transducers, attribute grammars, and MSO definable tree translations. Inf. Comput. 154(1), 34\u201391 (1999)","journal-title":"Inf. Comput."},{"issue":"4","key":"17_CR9","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1137\/S0097539701394511","volume":"32","author":"J Engelfriet","year":"2003","unstructured":"Engelfriet, J., Maneth, S.: Macro tree translations of linear size increase are MSO definable. SIAM J. Comput. 32(4), 950\u20131006 (2003)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"17_CR10","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/j.ipl.2006.05.015","volume":"100","author":"J Engelfriet","year":"2006","unstructured":"Engelfriet, J., Maneth, S.: The equivalence problem for deterministic MSO tree transducers is decidable. Inf. Process. Lett. 100(5), 206\u2013212 (2006)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"17_CR11","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0022-0000(80)90058-6","volume":"20","author":"J Engelfriet","year":"1980","unstructured":"Engelfriet, J., Rozenberg, G., Slutzki, G.: Tree transducers, L systems, and two-way machines. J. Comput. Syst. Sci. 20(2), 150\u2013202 (1980)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"17_CR12","first-page":"1","volume":"5","author":"Z \u00c9sik","year":"1980","unstructured":"\u00c9sik, Z.: Decidability results concerning tree transducers I. Acta Cybern. 5(1), 1\u201320 (1980)","journal-title":"Acta Cybern."},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"F\u00fcl\u00f6p, Z., Vogler, H.: Syntax-Directed Semantics - Formal Models Based on Tree Transducers. Springer, Monographs in Theoretical Computer Science. An EATCS Series (1998)","DOI":"10.1007\/978-3-642-72248-6"},{"issue":"3","key":"17_CR14","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1145\/321466.321473","volume":"15","author":"TV Griffiths","year":"1968","unstructured":"Griffiths, T.V.: The unsolvability of the equivalence problem for lambda-free nondeterministic generalized machines. J. ACM 15(3), 409\u2013413 (1968)","journal-title":"J. ACM"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Hakuta, S., Maneth, S., Nakano, K., Iwasaki, H.: Xquery streaming by forest transducers. In: ICDE, pp. 952\u2013963 (2014)","DOI":"10.1109\/ICDE.2014.6816714"},{"issue":"12","key":"17_CR16","doi-asserted-by":"publisher","first-page":"1741","DOI":"10.1016\/j.ic.2007.08.003","volume":"205","author":"R K\u00fcsters","year":"2007","unstructured":"K\u00fcsters, R., Wilke, T.: Transducer-based analysis of cryptographic protocols. Inf. Comput. 205(12), 1741\u20131776 (2007)","journal-title":"Inf. Comput."},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"A. Lemay, S. Maneth, and J. Niehren. A learning algorithm for top-down XML transformations. In: PODS, pp. 285\u2013296 (2010)","DOI":"10.1145\/1807085.1807122"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Maletti, A.: Tree transformations and dependencies. In: MOL, pp. 1\u201320 (2011)","DOI":"10.1007\/978-3-642-23211-4_1"},{"issue":"2","key":"17_CR19","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/070699160","volume":"39","author":"A Maletti","year":"2009","unstructured":"Maletti, A., Graehl, J., Hopkins, M., Knight, K.: The power of extended top-down tree transducers. SIAM J. Comput. 39(2), 410\u2013430 (2009)","journal-title":"SIAM J. Comput."},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Maneth, S.: Equivalence problems for tree transducers (survey). In: AFL, pp. 74\u201393 (2014)","DOI":"10.4204\/EPTCS.151.5"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Matsuda, K., Inaba, K., Nakano, K.: Polynomial-time inverse computation for accumulative functions with multiple data traversals. In: PEPM, pp. 5\u201314 (2012)","DOI":"10.1145\/2103746.2103752"},{"issue":"1","key":"17_CR22","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/S0022-0000(02)00030-2","volume":"66","author":"T Milo","year":"2003","unstructured":"Milo, T., Suciu, D., Vianu, V.: Typechecking for XML transformers. J. Comput. Syst. Sci. 66(1), 66\u201397 (2003)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"17_CR23","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/BF01695769","volume":"4","author":"WC Rounds","year":"1970","unstructured":"Rounds, W.C.: Mappings and grammars on trees. Math. Syst. Th. 4(3), 257\u2013287 (1970)","journal-title":"Math. Syst. Th."},{"issue":"4","key":"17_CR24","first-page":"339","volume":"4","author":"JW Thatcher","year":"1970","unstructured":"Thatcher, J.W.: Generalized sequential machine maps. JCSS 4(4), 339\u2013367 (1970)","journal-title":"JCSS"},{"issue":"5\/6","key":"17_CR25","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1016\/S0747-7171(06)80004-0","volume":"15","author":"A van Deursen","year":"1993","unstructured":"van Deursen, A., Klint, P., Tip, F.: Origin tracking. J. Symb. Comput. 15(5\/6), 523\u2013545 (1993)","journal-title":"J. Symb. Comput."},{"issue":"5","key":"17_CR26","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1017\/S0956796813000130","volume":"23","author":"J Voigtl\u00e4nder","year":"2013","unstructured":"Voigtl\u00e4nder, J., Hu, Z., Matsuda, K., Wang, M.: Enhancing semantic bidirectionalization via shape bidirectionalizer plug-ins. J. Funct. Program. 23(5), 515\u2013551 (2013)","journal-title":"J. Funct. Program."},{"issue":"3","key":"17_CR27","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1017\/S0956796803004933","volume":"14","author":"J Voigtl\u00e4nder","year":"2004","unstructured":"Voigtl\u00e4nder, J., K\u00fchnemann, A.: Composition of functions with accumulating parameters. J. Funct. Program. 14(3), 317\u2013363 (2004)","journal-title":"J. Funct. Program."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47666-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T13:26:22Z","timestamp":1674566782000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47666-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476659","9783662476666"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47666-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}