{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:34:34Z","timestamp":1725798874529},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319096971"},{"type":"electronic","value":"9783319096988"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09698-8_10","type":"book-chapter","created":{"date-parts":[[2014,8,18]],"date-time":"2014-08-18T00:52:51Z","timestamp":1408323171000},"page":"103-115","source":"Crossref","is-referenced-by-count":1,"title":["How to Remove the Look-Ahead of Top-Down Tree Transducers"],"prefix":"10.1007","author":[{"given":"Joost","family":"Engelfriet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Maneth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Helmut","family":"Seidl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-31585-5_8","volume-title":"Automata, Languages, and Programming","author":"R. Alur","year":"2012","unstructured":"Alur, R., D\u2019Antoni, L.: Streaming tree transducers. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol.\u00a07392, pp. 42\u201353. Springer, Heidelberg (2012)"},{"doi-asserted-by":"crossref","unstructured":"Berstel, J.: Transductions and Context-Free Languages. Teubner-Verlag (1979)","key":"10_CR2","DOI":"10.1007\/978-3-663-09367-1"},{"issue":"3","key":"10_CR3","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0304-3975(77)90049-4","volume":"5","author":"C. Choffrut","year":"1977","unstructured":"Choffrut, C.: Une caract\u00e9risation des fonctions s\u00e9quentielles et des fonctions sous-s\u00e9quentielles en tant que relations rationnelles. Theor. Comput. Sci.\u00a05(3), 325\u2013337 (1977)","journal-title":"Theor. Comput. Sci."},{"unstructured":"Drewes, F.: Grammatical Picture Generation \u2013 A Tree-Based Approach. Springer (2006)","key":"10_CR4"},{"key":"10_CR5","doi-asserted-by":"publisher","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. Mathematical Systems Theory\u00a010, 289\u2013303 (1977)","journal-title":"Mathematical Systems Theory"},{"issue":"5","key":"10_CR6","doi-asserted-by":"publisher","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.\u00a075(5), 271\u2013286 (2009)","journal-title":"J. Comput. Syst. Sci."},{"doi-asserted-by":"crossref","unstructured":"Engelfriet, J., Maneth, S., Seidl, H.: Look-ahead removal for top-down tree transducers. CoRR abs\/1311.2400 (2013)","key":"10_CR7","DOI":"10.1007\/978-3-319-09698-8_10"},{"issue":"1","key":"10_CR8","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.\u00a031(1), 71\u2013146 (1985)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR9","first-page":"1","volume":"5","author":"Z. \u00c9sik","year":"1980","unstructured":"\u00c9sik, Z.: Decidability results concerning tree transducers I. Acta Cybern.\u00a05, 1\u201320 (1980)","journal-title":"Acta Cybern."},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/978-3-642-27660-6_21","volume-title":"SOFSEM 2012: Theory and Practice of Computer Science","author":"E. Filiot","year":"2012","unstructured":"Filiot, E., Servais, F.: Visibly pushdown transducers with look-ahead. In: Bielikov\u00e1, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Tur\u00e1n, G. (eds.) SOFSEM 2012. LNCS, vol.\u00a07147, pp. 251\u2013263. Springer, Heidelberg (2012)"},{"doi-asserted-by":"crossref","unstructured":"Hosoya, H.: Foundations of XML Processing \u2013 The Tree-Automata Approach. Cambridge University Press (2010)","key":"10_CR11","DOI":"10.1017\/CBO9780511762093"},{"key":"10_CR12","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)"},{"doi-asserted-by":"crossref","unstructured":"Lemay, A., Maneth, S., Niehren, J.: A learning algorithm for top-down XML transformations. In: PODS, pp. 285\u2013296 (2010)","key":"10_CR13","DOI":"10.1145\/1807085.1807122"},{"issue":"2","key":"10_CR14","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.\u00a039(2), 410\u2013430 (2009)","journal-title":"SIAM J. Comput."},{"issue":"7","key":"10_CR15","doi-asserted-by":"publisher","first-page":"806","DOI":"10.1016\/j.ic.2008.01.002","volume":"206","author":"W. Martens","year":"2008","unstructured":"Martens, W., Neven, F., Gyssens, M.: Typechecking top-down XML transformations: Fixed input or output schemas. Inf. Comput.\u00a0206(7), 806\u2013827 (2008)","journal-title":"Inf. Comput."}],"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-09698-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T16:09:07Z","timestamp":1558973347000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09698-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319096971","9783319096988"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09698-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}