{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,31]],"date-time":"2025-08-31T23:11:49Z","timestamp":1756681909269},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705826"},{"type":"electronic","value":"9783540705833"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-70583-3_32","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"386-397","source":"Crossref","is-referenced-by-count":24,"title":["Visibly Pushdown Transducers"],"prefix":"10.1007","author":[{"given":"Jean-Fran\u00e7ois","family":"Raskin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Servais","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-2","key":"32_CR1","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.jlap.2006.02.001","volume":"69","author":"P. Abdulla","year":"2006","unstructured":"Abdulla, P., Legay, A., d\u2019Orso, J., Rezine, A.: Tree regular model checking: A simulation-based approach. J. Log. Algebr. Program.\u00a069(1-2), 93\u2013121 (2006)","journal-title":"J. Log. Algebr. Program."},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Alur, R.: Marrying words and trees. In: PODS, pp. 233\u2013242 (2007)","DOI":"10.1145\/1265530.1265564"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: STOC, pp. 202\u2013211 (2004)","DOI":"10.1145\/1007352.1007390"},{"key":"32_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11779148_1","volume-title":"Developments in Language Theory","author":"R. Alur","year":"2006","unstructured":"Alur, R., Madhusudan, P.: Adding nesting structure to words. In: H. Ibarra, O., Dang, Z. (eds.) DLT 2006. LNCS, vol.\u00a04036, pp. 1\u201313. Springer, Heidelberg (2006)"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Bouajjani, A., Jonsson, B., Nilsson, M., Touili, T.: Regular model checking. In: CAV, pp. 403\u2013418 (2000)","DOI":"10.1007\/10722167_31"},{"key":"32_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/3-540-45294-X_14","volume-title":"FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science","author":"D. Fisman","year":"2001","unstructured":"Fisman, D., Pnueli, A.: Beyond regular model checking. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2001. LNCS, vol.\u00a02245, pp. 156\u2013170. Springer, Heidelberg (2001)"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Maneth, S., Berlea, A., Perst, T., Seidl, H.: XML type checking with macro tree transducers. In: PODS, pp. 283\u2013294 (2005)","DOI":"10.1145\/1065167.1065203"},{"key":"32_CR8","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":"32_CR9","doi-asserted-by":"crossref","unstructured":"Milo, T., Suciu, D., Vianu, V.: Typechecking for XML transformers. In: PODS, pp. 11\u201322 (2000)","DOI":"10.1145\/335168.335171"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Raskin, J.-F., Servais, F.: Visibly pushdown transducers. Technical Report 2008.100, Federated Center for Verification - Universit\u00e9 Libre de Bruxelles (2008), http:\/\/www.ulb.ac.be\/di\/ssd\/cfv\/publications.html","DOI":"10.1007\/978-3-540-70583-3_32"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Thomo, A., Venkatesh, S., Ying Ye, Y.: Visibly pushdown transducers for approximate validation of streaming XML. In: FoIKS, pp. 219\u2013238 (2008)","DOI":"10.1007\/978-3-540-77684-0_16"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70583-3_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T18:17:06Z","timestamp":1631643426000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70583-3_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540705826","9783540705833"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70583-3_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}