{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T10:59:53Z","timestamp":1753354793719},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642151545"},{"type":"electronic","value":"9783642151552"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15155-2_32","type":"book-chapter","created":{"date-parts":[[2010,8,13]],"date-time":"2010-08-13T20:17:45Z","timestamp":1281730665000},"page":"355-367","source":"Crossref","is-referenced-by-count":17,"title":["Properties of Visibly Pushdown Transducers"],"prefix":"10.1007","author":[{"given":"Emmanuel","family":"Filiot","sequence":"first","affiliation":[]},{"given":"Jean-Fran\u00e7ois","family":"Raskin","sequence":"additional","affiliation":[]},{"given":"Pierre-Alain","family":"Reynier","sequence":"additional","affiliation":[]},{"given":"Fr\u00e9d\u00e9ric","family":"Servais","sequence":"additional","affiliation":[]},{"given":"Jean-Marc","family":"Talbot","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/978-3-540-77220-0","volume-title":"PODS","author":"R. Alur","year":"2007","unstructured":"Alur, R.: Marrying words and trees. In: PODS. LNCS, vol.\u00a05140, pp. 233\u2013242. Springer, Heidelberg (2007)"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: STOC, pp. 202\u2013211 (2004)","DOI":"10.1145\/1007352.1007390"},{"issue":"1","key":"32_CR3","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0304-3975(01)00214-6","volume":"292","author":"M.-P. B\u00e9al","year":"2003","unstructured":"B\u00e9al, M.-P., Carton, O., Prieur, C., Sakarovitch, J.: Squaring transducers: an efficient procedure for deciding functionality and sequentiality. TCS\u00a0292(1), 45\u201363 (2003)","journal-title":"TCS"},{"issue":"3","key":"32_CR4","first-page":"310","volume":"15","author":"M. Blattner","year":"1977","unstructured":"Blattner, M., Head, T.: Single-valued a-transducers. JCSS\u00a015(3), 310\u2013327 (1977)","journal-title":"JCSS"},{"key":"32_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"},{"key":"32_CR6","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. SICOMP\u00a032, 950\u20131006 (2003)","journal-title":"SICOMP"},{"issue":"5","key":"32_CR7","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/j.ipl.2006.05.015","volume":"100","author":"J. Engelfriet","year":"2006","unstructured":"Engelfriet, J., Maneth, S.: The equivalence problem for deterministic MSO tree transducers is decidable. IPL\u00a0100(5), 206\u2013212 (2006)","journal-title":"IPL"},{"issue":"1","key":"32_CR8","first-page":"71","volume":"31","author":"J. Engelfriet","year":"1985","unstructured":"Engelfriet, J., Vogler, H.: Macro tree transducers. JCSS\u00a031(1), 71\u2013146 (1985)","journal-title":"JCSS"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Filiot, E., Raskin, J.-F., Reynier, P.-A., Servais, F., Talbot, J.-M.: On functionality of visibly pushdown transducers. CoRR, abs\/1002.1443 (2010)","DOI":"10.1007\/978-3-642-15155-2_32"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Gurari, E.M., Ibarra, O.H.: A note on finite-valued and finitely ambiguous transducers. MST\u00a016 (1983)","DOI":"10.1007\/BF01744569"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Harju, T., Ibarra, O.H., Karhumaki, J., Salomaa, A.: Some decision problems concerning semilinearity and commutation. JCSS\u00a065 (2002)","DOI":"10.1006\/jcss.2002.1836"},{"issue":"1","key":"32_CR12","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"O.H. Ibarra","year":"1978","unstructured":"Ibarra, O.H.: Reversal-bounded multicounter machines and their decision problems. JACM\u00a025(1), 116\u2013133 (1978)","journal-title":"JACM"},{"key":"32_CR13","unstructured":"Inaba, K., Maneth, S.: The complexity of translation membership for macro tree transducers. CoRR, abs\/0910.2315 (2009)"},{"issue":"3","key":"32_CR14","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s00778-005-0169-1","volume":"16","author":"C. Koch","year":"2007","unstructured":"Koch, C., Scherzinger, S.: Attribute grammars for scalable query processing on XML streams. VLDB\u00a016(3), 317\u2013342 (2007)","journal-title":"VLDB"},{"key":"32_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-44543-9_6","volume-title":"Research Issues in Structured and Semistructured Database Programming","author":"S. Maneth","year":"2000","unstructured":"Maneth, S., Neven, F.: Structured document transformations based on XSL. In: Connor, R.C.H., Mendelzon, A.O. (eds.) DBPL 1999. LNCS, vol.\u00a01949, pp. 80\u201398. Springer, Heidelberg (2000)"},{"issue":"3","key":"32_CR16","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.ipl.2003.05.001","volume":"89","author":"T. Perst","year":"2004","unstructured":"Perst, T., Seidl, H.: Macro forest transducers. IPL\u00a089(3), 141\u2013149 (2004)","journal-title":"IPL"},{"key":"32_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/BFb0049431","volume-title":"Algorithms - ESA 1994","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)"},{"key":"32_CR18","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":"32_CR19","doi-asserted-by":"crossref","unstructured":"Sch\u00fctzenberger, M.P.: Sur les relations rationnelles. In: Automata Theory and Formal Languages. LNCS, vol.\u00a033, pp. 209\u2013213. Springer, Heidelberg (1975)","DOI":"10.1007\/3-540-07407-4_22"},{"issue":"1","key":"32_CR20","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0304-3975(92)90281-J","volume":"106","author":"H. Seidl","year":"1992","unstructured":"Seidl, H.: Single-valuedness of tree transducers is decidable in polynomial time. TCS\u00a0106(1), 135\u2013181 (1992)","journal-title":"TCS"},{"issue":"4","key":"32_CR21","first-page":"285","volume":"27","author":"H. Seidl","year":"1994","unstructured":"Seidl, H.: Equivalence of finite-valued tree transducers is decidable. MST\u00a027(4), 285\u2013346 (1994)","journal-title":"MST"},{"key":"32_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1007\/3-540-48523-6_63","volume-title":"Automata, Languages and Programming","author":"G. S\u00e9nizergues","year":"1999","unstructured":"S\u00e9nizergues, G.: T(A) = T(B)? In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 665\u2013675. Springer, Heidelberg (1999)"},{"key":"32_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1007\/978-3-642-03409-1_28","volume-title":"FCT","author":"S. Staworko","year":"2009","unstructured":"Staworko, S., Laurence, G., Lemay, A., Niehren, J.: Equivalence of deterministic nested word to word transducers. In: Ge\u0327bala, M. (ed.) FCT 2009. LNCS, vol.\u00a05699, pp. 310\u2013322. Springer, Heidelberg (2009)"},{"key":"32_CR24","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/11532231_25","volume-title":"Automated Deduction \u2013 CADE-20","author":"K.N. Verma","year":"2005","unstructured":"Verma, K.N., Seidl, H., Schwentick, T.: On the complexity of equational horn clauses. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol.\u00a03632, pp. 337\u2013352. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15155-2_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:01:41Z","timestamp":1606186901000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15155-2_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642151545","9783642151552"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15155-2_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}