{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:10:39Z","timestamp":1725905439920},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319628080"},{"type":"electronic","value":"9783319628097"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-62809-7_7","type":"book-chapter","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T08:37:57Z","timestamp":1500539877000},"page":"109-121","source":"Crossref","is-referenced-by-count":0,"title":["Equivalence of Symbolic Tree Transducers"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Hugot","sequence":"first","affiliation":[]},{"given":"Adrien","family":"Boiret","sequence":"additional","affiliation":[]},{"given":"Joachim","family":"Niehren","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,21]]},"reference":[{"issue":"2","key":"7_CR1","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/S0019-9958(79)90561-8","volume":"41","author":"BS Baker","year":"1979","unstructured":"Baker, B.S.: Composition of top-down and bottom-up tree transductions. Inf. Control 41(2), 186\u2013213 (1979)","journal-title":"Inf. Control"},{"key":"7_CR2","unstructured":"Boiret, A.: Normalization and learning of transducers on trees and words. Ph.D. thesis, Lille University, France (2016)"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. LNCS, vol. 8573, pp. 26\u201337. Springer, Heidelberg (2014). doi: 10.1007\/978-3-662-43951-7_3"},{"issue":"1","key":"7_CR4","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0304-3975(01)00219-5","volume":"292","author":"C Choffrut","year":"2003","unstructured":"Choffrut, C.: Minimizing subsequential transducers: a survey. Theor. Comput. Sci. 292(1), 131\u2013143 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR5","unstructured":"Comon, H., Dauchet, M., Gilleron, R., L\u00f6ding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007). http:\/\/www.grappa.univ-lille3.fr\/tata . Accessed 12th October 2007"},{"issue":"1","key":"7_CR6","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1147\/rd.91.0047","volume":"9","author":"CC Elgot","year":"1965","unstructured":"Elgot, C.C., Mezei, J.E.: On relations defined by generalized finite automata. IBM J. Res. Dev. 9(1), 47\u201368 (1965)","journal-title":"IBM J. Res. Dev."},{"issue":"3","key":"7_CR7","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/BF01704020","volume":"9","author":"J Engelfriet","year":"1975","unstructured":"Engelfriet, J.: Bottom-up and top-down tree transformations - a comparison. Math. Syst. Theor. 9(3), 198\u2013231 (1975)","journal-title":"Math. Syst. Theor."},{"key":"7_CR8","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF01683280","volume":"10","author":"J Engelfriet","year":"1977","unstructured":"Engelfriet, J.: Top-down tree transducers with regular look-ahead. Math. Syst. Theor. 10, 289\u2013303 (1977)","journal-title":"Math. Syst. Theor."},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Engelfriet, J.: Some Open Questions and Recent Results on Tree Transducers and Tree Languages, pp. 241\u2013286. Academic Press, Cambridge (1980)","DOI":"10.1016\/B978-0-12-115350-2.50014-2"},{"issue":"4","key":"7_CR10","doi-asserted-by":"crossref","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":"7_CR11","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/j.jcss.2009.01.001","volume":"75","author":"J Engelfriet","year":"2009","unstructured":"Engelfriet, J., Maneth, S., Seidl, H.: Deciding equivalence of top-down XML transformations in polynomial time. J. Comput. Syst. Sci. 75(5), 271\u2013286 (2009)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"7_CR12","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0022-0000(85)90066-2","volume":"31","author":"J Engelfriet","year":"1985","unstructured":"Engelfriet, J., Vogler, H.: Macro tree transducers. J. Comput. Syst. Sci. 31(1), 71\u2013146 (1985)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR13","unstructured":"\u00c9sik, Z.: On functional tree transducers. In: FCT, pp. 121\u2013127 (1979)"},{"issue":"3","key":"7_CR14","first-page":"303","volume":"6","author":"Z \u00c9sik","year":"1983","unstructured":"\u00c9sik, Z.: Decidability results concerning tree transducers II. Acta Cybern. 6(3), 303\u2013314 (1983)","journal-title":"Acta Cybern."},{"issue":"5","key":"7_CR15","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s00236-014-0197-7","volume":"51","author":"Z F\u00fcl\u00f6p","year":"2014","unstructured":"F\u00fcl\u00f6p, Z., Vogler, H.: Forward and backward application of symbolic tree transducers. Acta Inf. 51(5), 297\u2013325 (2014)","journal-title":"Acta Inf."},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Lemay, A., Maneth, S., Niehren, J.: A learning algorithm for top-down XML transformations. In: PODS, pp. 285\u2013296. ACM (2010)","DOI":"10.1145\/1807085.1807122"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Maneth, S.: Equivalence problems for tree transducers: a brief survey. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) AFL. EPTCS, vol. 151, pp. 74\u201393 (2014)","DOI":"10.4204\/EPTCS.151.5"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Seidl, H., Maneth, S., Kemper, G.: Equivalence of deterministic top-down tree-to-string transducers is decidable. In: FOCS, pp. 943\u2013962 (2015)","DOI":"10.1109\/FOCS.2015.62"},{"key":"7_CR19","first-page":"141","volume":"105","author":"M Veanes","year":"2011","unstructured":"Veanes, M., Bj\u00f8rner, N.: Foundations of finite symbolic tree transducers. EATCS 105, 141\u2013173 (2011)","journal-title":"EATCS"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-642-29709-0_32","volume-title":"Perspectives of Systems Informatics","author":"M Veanes","year":"2012","unstructured":"Veanes, M., Bj\u00f8rner, N.: Symbolic tree transducers. In: Clarke, E., Virbitskaite, I., Voronkov, A. (eds.) PSI 2011. LNCS, vol. 7162, pp. 377\u2013393. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-29709-0_32"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62809-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T03:04:51Z","timestamp":1569899091000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-62809-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319628080","9783319628097"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62809-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}