{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T11:28:49Z","timestamp":1753356529963},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212536"},{"type":"electronic","value":"9783642212543"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21254-3_28","type":"book-chapter","created":{"date-parts":[[2011,5,27]],"date-time":"2011-05-27T05:38:04Z","timestamp":1306474684000},"page":"354-365","source":"Crossref","is-referenced-by-count":7,"title":["Normalization of Sequential Top-Down Tree-to-Word Transducers"],"prefix":"10.1007","author":[{"given":"Gr\u00e9goire","family":"Laurence","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aur\u00e9lien","family":"Lemay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joachim","family":"Niehren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u0142awek","family":"Staworko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Tommasi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1102","DOI":"10.1007\/11523468_89","volume-title":"Automata, Languages and Programming","author":"R. Alur","year":"2005","unstructured":"Alur, R., Kumar, V., Madhusudan, P., Viswanathan, M.: Congruences for visibly pushdown languages. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1102\u20131114. Springer, Heidelberg (2005)"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Berstel, J., Boasson, L.: Transductions and context-free languages. Teubner Studienbucher (1979)","DOI":"10.1007\/978-3-663-09367-1"},{"key":"28_CR3","unstructured":"Choffru, C.: Contribution \u00e0 l\u2019\u00e9tude de quelques familles remarquables de fonctions rationnelles. PhD thesis, Universit\u00e9 de Paris VII (1978)"},{"issue":"1","key":"28_CR4","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. Theoretical Computer Science\u00a0292(1), 131\u2013143 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"28_CR5","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. Journal of Computer and System Science\u00a075(5), 271\u2013286 (2009)","journal-title":"Journal of Computer and System Science"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-642-15155-2_32","volume-title":"Mathematical Foundations of Computer Science 2010","author":"E. Filiot","year":"2010","unstructured":"Filiot, E., Raskin, J.F., Reynier, P.A., Servais, F., Talbot, J.M.: Properties of visibly pushdown transducers. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol.\u00a06281, pp. 355\u2013367. Springer, Heidelberg (2010)"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-642-14455-4_18","volume-title":"Developments in Language Theory","author":"S. Friese","year":"2010","unstructured":"Friese, S., Seidl, H., Maneth, S.: Minimization of deterministic bottom-up tree transducers. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol.\u00a06224, pp. 185\u2013196. Springer, Heidelberg (2010)"},{"issue":"3","key":"28_CR8","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1145\/321466.321473","volume":"15","author":"T.V. Griffiths","year":"1968","unstructured":"Griffiths, T.V.: The unsolvability of the equivalence problem for lambda-free nondeterministic generalized machines. Journal of the ACM\u00a015(3), 409\u2013413 (1968)","journal-title":"Journal of the ACM"},{"issue":"3","key":"28_CR9","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1137\/0211035","volume":"11","author":"E.M. Gurari","year":"1982","unstructured":"Gurari, E.M.: The equivalence problem for deterministic two-way sequential transducers is decidable. SIAM Journal on Computing\u00a011(3), 448\u2013452 (1982)","journal-title":"SIAM Journal on Computing"},{"key":"28_CR10","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"2001","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison-Wesley, Reading (2001)","edition":"2"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Lemay, A., Maneth, S., Niehren, J.: A learning algorithm for top-down xml transformations. In: ACM Symposium on Principles of Database Systems (PODS), pp. 285\u2013296 (2010)","DOI":"10.1145\/1807085.1807122"},{"key":"28_CR12","series-title":"Cambridge Mathematical Library","volume-title":"Combinatorics on Words","year":"1997","unstructured":"Lothaire, M. (ed.): Combinatorics on Words, 2nd edn. Cambridge Mathematical Library. Cambridge University Press, Cambridge (1997)","edition":"2"},{"key":"28_CR13","unstructured":"Maneth, S.: Models of Tree Translation. PhD thesis, Leiden University (2003)"},{"issue":"7","key":"28_CR14","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. Information and Computation\u00a0206(7), 806\u2013827 (2008)","journal-title":"Information and Computation"},{"key":"28_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-540-70583-3_32","volume-title":"Automata, Languages and Programming","author":"J.-F. Raskin","year":"2008","unstructured":"Raskin, J.-F., Servais, F.: Visibly pushdown transducers. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 386\u2013397. Springer, Heidelberg (2008)"},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-642-03409-1_28","volume-title":"Fundamentals of Computation Theory","author":"S. Staworko","year":"2009","unstructured":"Staworko, S., Laurence, G., Lemay, A., Niehren, J.: Equivalence of deterministic nested word to word transducers. In: Kuty\u0142owski, M., Charatonik, W., G\u0119bala, M. (eds.) FCT 2009. LNCS, vol.\u00a05699, pp. 310\u2013322. Springer, Heidelberg (2009)"}],"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-642-21254-3_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T20:30:32Z","timestamp":1553718632000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21254-3_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212536","9783642212543"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21254-3_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}