{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:07:47Z","timestamp":1725538067120},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642034084"},{"type":"electronic","value":"9783642034091"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03409-1_28","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:05:18Z","timestamp":1252937118000},"page":"310-322","source":"Crossref","is-referenced-by-count":13,"title":["Equivalence of Deterministic Nested Word to Word Transducers"],"prefix":"10.1007","author":[{"given":"S\u0142awomir","family":"Staworko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gr\u00e9goire","family":"Laurence","sequence":"additional","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"}]}],"member":"297","reference":[{"key":"28_CR1","first-page":"233","volume":"26","author":"R. Alur","year":"2007","unstructured":"Alur, R.: Marrying words and trees. ACM SIGMOD-SIGACT-SIGART SPDS\u00a026, 233\u2013242 (2007)","journal-title":"ACM SIGMOD-SIGACT-SIGART SPDS"},{"key":"28_CR2","first-page":"202","volume":"36","author":"R. Alur","year":"2004","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. ACM STC\u00a036, 202\u2013211 (2004)","journal-title":"ACM STC"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-540-88282-4_18","volume-title":"Language and Automata Theory and Applications","author":"J. Champav\u00e8re","year":"2008","unstructured":"Champav\u00e8re, J., Gilleron, R., Lemay, A., Niehren, J.: Efficient Inclusion Checking for Deterministic Tree Automata and DTDs. In: Mart\u00edn-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol.\u00a05196, pp. 184\u2013195. Springer, Heidelberg (2008)"},{"key":"28_CR4","unstructured":"Comon, H., Dauchet, M., Gilleron, R., L\u00f6ding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommas, M.: Tree Auto. Tech. and App. online (revised 2007)"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Engelfriet, J., Maneth, S., Seidl, H.: Deciding Equiv. of Top-Down XML Transformations in Poly. Time. Journal of Comp. and Syst. Sci. (to appear, 2009)","DOI":"10.1016\/j.jcss.2009.01.001"},{"issue":"1","key":"28_CR6","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.ipl.2008.08.002","volume":"109","author":"O. Gauwin","year":"2008","unstructured":"Gauwin, O., Niehren, J., Roos, Y.: Streaming tree automata. IPL\u00a0109(1), 13\u201317 (2008)","journal-title":"IPL"},{"issue":"5","key":"28_CR7","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/BF00288472","volume":"23","author":"K. Culik II","year":"1986","unstructured":"Culik II, K., Karhum\u00e4ki, J.: Synchronizable deterministic pushdown automata and the decidability of their equivalence. Acta Inf.\u00a023(5), 597\u2013605 (1986)","journal-title":"Acta Inf."},{"key":"28_CR8","unstructured":"Maneth. S.: Models of Tree Translation. PhD Thesis"},{"key":"28_CR9","first-page":"283","volume":"24","author":"S. Maneth","year":"2005","unstructured":"Maneth, S., Berlea, A., Perst, T., Seidl, H.: Type checking with macro tree transducers. ACM SPDS\u00a024, 283\u2013294 (2005)","journal-title":"ACM SPDS"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/3-540-36285-1_5","volume-title":"Database Theory - ICDT 2003","author":"W. Martens","year":"2002","unstructured":"Martens, W., Neven, F.: Typechecking top-down uniform unranked tree transducers. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol.\u00a02572, pp. 64\u201378. Springer, Heidelberg (2002)"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Neumann, A., Seidl, H.: Locating matches of tree patterns in forests. Found. of Soft. Tech. and Theor. Comp. Sci., 134\u2013145 (1998)","DOI":"10.1007\/978-3-540-49382-2_12"},{"key":"28_CR12","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.: Learn. Subseq. Transd. for Patt. Recogn. and Interpretation Tasks. Trans. on Patt. Anal. and Mach. Intel.\u00a015, 448\u2013458 (1993)","journal-title":"Trans. on Patt. Anal. and Mach. Intel."},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/BFb0049431","volume-title":"Algorithms - ESA \u201994","author":"W. Plandowski","year":"1994","unstructured":"Plandowski, W.: Testing Equivalence of Morphisms on Context-Free Languages. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol.\u00a0855, pp. 460\u2013470. Springer, Heidelberg (1994)"},{"issue":"1","key":"28_CR14","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1006\/jcss.1995.1002","volume":"50","author":"J. Karhum\u00e4ki","year":"1995","unstructured":"Karhum\u00e4ki, J., Plandowski, W., Rytter, W.: Polynomial Size Test Sets for Context-Free Languages. J. Comput. Syst. Sci.\u00a050(1), 11\u201319 (1995)","journal-title":"J. Comput. Syst. Sci."},{"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":"671","DOI":"10.1007\/3-540-63165-8_221","volume-title":"Automata, Languages and Programming","author":"G. S\u00e9nizergues","year":"1997","unstructured":"S\u00e9nizergues, G.: The equivalence problem for deterministic pushdown automata is decidable. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol.\u00a01256, pp. 671\u2013681. Springer, Heidelberg (1997)"},{"key":"28_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-540-71389-0_25","volume-title":"Foundations of Software Science and Computational Structures","author":"A. Tozawa","year":"2007","unstructured":"Tozawa, A., Minamide, Y.: Complexity results on balanced context-free languages. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol.\u00a04423, pp. 346\u2013360. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03409-1_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T15:15:44Z","timestamp":1558538144000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03409-1_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642034084","9783642034091"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03409-1_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}