{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T02:52:00Z","timestamp":1725850320686},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319299990"},{"type":"electronic","value":"9783319300009"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-30000-9_34","type":"book-chapter","created":{"date-parts":[[2016,2,25]],"date-time":"2016-02-25T16:45:50Z","timestamp":1456418750000},"page":"439-451","source":"Crossref","is-referenced-by-count":2,"title":["Normal Form on Linear Tree-to-Word Transducers"],"prefix":"10.1007","author":[{"given":"Adrien","family":"Boiret","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,26]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., D\u2019Antoni, L.: Streaming tree transducers. CoRR \n                      abs\/1104.2599\n                      \n                     (2011)","DOI":"10.1007\/978-3-642-20920-8_1"},{"issue":"1","key":"34_CR2","doi-asserted-by":"publisher","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."},{"issue":"4","key":"34_CR3","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."},{"key":"34_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/11590156_40","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"J Engelfriet","year":"2005","unstructured":"Engelfriet, J., Maneth, S.: The equivalence problem for deterministic MSO tree transducers is decidable. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 495\u2013504. Springer, Heidelberg (2005)"},{"issue":"1","key":"34_CR5","doi-asserted-by":"publisher","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":"34_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-642-21254-3_28","volume-title":"Language and Automata Theory and Applications","author":"G Laurence","year":"2011","unstructured":"Laurence, G., Lemay, A., Niehren, J., Staworko, S., Tommasi, M.: Normalization of sequential top-down tree-to-word transducers. In: Dediu, A.-H., Inenaga, S., Mart\u00edn-Vide, C. (eds.) LATA 2011. LNCS, vol. 6638, pp. 354\u2013365. Springer, Heidelberg (2011)"},{"key":"34_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/978-3-319-04921-2_40","volume-title":"Language and Automata Theory and Applications","author":"G Laurence","year":"2014","unstructured":"Laurence, G., Lemay, A., Niehren, J., Staworko, S., Tommasi, M.: Learning sequential tree-to-word transducers. In: Dediu, A.-H., Mart\u00edn-Vide, C., Sierra-Rodr\u00edguez, J.-L., Truthe, B. (eds.) LATA 2014. LNCS, vol. 8370, pp. 490\u2013502. Springer, Heidelberg (2014)"},{"key":"34_CR8","unstructured":"Lemay, A., Maneth, S., Niehren, J.: A learning algorithm for top-down XML transformations. In: Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2010, June 6\u201311, 2010, Indianapolis, Indiana, USA, pp. 285\u2013296 (2010)"},{"key":"34_CR9","unstructured":"Maneth, S., Seidl, H.: Deciding equivalence of top-down XML transformations in polynomial time. In: PLAN-X , Programming Language Technologies for XML, An ACM SIGPLAN Workshop Colocated with POpPL 2007, Nice, France, January 20, 2007, pp. 73\u201379 (2007)"},{"issue":"5","key":"34_CR10","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1109\/34.211465","volume":"15","author":"J Oncina","year":"1993","unstructured":"Oncina, J., Garcia, P., Vidal, E.: Learning subsequential transducers for pattern recognition interpretation tasks. IEEE Trans. Pattern Anal. Mach. Intell. 15(5), 448\u2013458 (1993)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Seidl, H., Maneth, S., Kemper, G.: Equivalence of deterministic top-down tree-to-string transducers is decidable. CoRR \n                      abs\/1503.09163\n                      \n                     (2015)","DOI":"10.1109\/FOCS.2015.62"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-30000-9_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T11:56:15Z","timestamp":1559390175000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-30000-9_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319299990","9783319300009"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-30000-9_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}