{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T20:08:01Z","timestamp":1725653281351},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642276590"},{"type":"electronic","value":"9783642276606"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-27660-6_21","type":"book-chapter","created":{"date-parts":[[2012,1,16]],"date-time":"2012-01-16T10:14:28Z","timestamp":1326708868000},"page":"251-263","source":"Crossref","is-referenced-by-count":7,"title":["Visibly Pushdown Transducers with Look-Ahead"],"prefix":"10.1007","author":[{"given":"Emmanuel","family":"Filiot","sequence":"first","affiliation":[]},{"given":"Fr\u00e9d\u00e9ric","family":"Servais","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: STOC, pp. 202\u2013211 (2004)","DOI":"10.1145\/1007352.1007390"},{"issue":"3","key":"21_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1516512.1516518","volume":"56","author":"R. Alur","year":"2009","unstructured":"Alur, R., Madhusudan, P.: Adding nesting structure to words. JACM\u00a056(3), 1\u201343 (2009)","journal-title":"JACM"},{"key":"21_CR3","unstructured":"Comon, H., Dauchet, M., Gilleron, R., L\u00f6ding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007)"},{"key":"21_CR4","unstructured":"Eilenberg, S.: Automata, Languages, and Machines. Academic Press, Inc. (1974)"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1147\/rd.91.0047","volume":"9","author":"C.C. Elgot","year":"1965","unstructured":"Elgot, C.C., Mezei, J.E.: On relations defined by generalized finite automata. IBM Journal of Research and Development\u00a09, 47\u201368 (1965)","journal-title":"IBM Journal of Research and Development"},{"key":"21_CR6","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":"4","key":"21_CR7","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/0020-0190(78)90060-1","volume":"7","author":"J. Engelfriet","year":"1978","unstructured":"Engelfriet, J.: On tree transducers for partial functions. Inf. Process. Lett.\u00a07(4), 170\u2013172 (1978)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"21_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":"21_CR9","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)"},{"issue":"3","key":"21_CR10","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/j.ic.2010.08.003","volume":"209","author":"O. Gauwin","year":"2011","unstructured":"Gauwin, O., Niehren, J., Tison, S.: Queries on XML streams with bounded delay and concurrency. Inf. Comput.\u00a0209(3), 409\u2013442 (2011)","journal-title":"Inf. Comput."},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Kumar, V., Madhusudan, P., Viswanathan, M.: Visibly pushdown automata for streaming XML. In: WWW, pp. 1053\u20131062 (2007)","DOI":"10.1145\/1242572.1242714"},{"issue":"3","key":"21_CR12","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"},{"issue":"3","key":"21_CR13","first-page":"758","volume":"47","author":"J. Sakarovitch","year":"2010","unstructured":"Sakarovitch, J., de Souza, R.: Lexicographic decomposition of k-valued transducers. TCS\u00a047(3), 758\u2013785 (2010)","journal-title":"TCS"},{"issue":"2","key":"21_CR14","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0304-3975(76)90026-8","volume":"3","author":"M.P. Sch\u00fctzenberger","year":"1976","unstructured":"Sch\u00fctzenberger, M.P.: Sur les relations rationnelles entre monoides libres. TCS\u00a03(2), 243\u2013259 (1976)","journal-title":"TCS"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Segoufin, L., Vianu, V.: Validating streaming XML documents. In: PODS, pp. 53\u201364 (2002)","DOI":"10.1145\/543613.543622"},{"key":"21_CR16","unstructured":"Servais, F.: Visibly Pushdown Transducers. PhD thesis, Universit\u00e9 Libre de Bruxelles (2011)"},{"key":"21_CR17","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)"},{"issue":"1","key":"21_CR18","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1137\/0222014","volume":"22","author":"A. Weber","year":"1993","unstructured":"Weber, A.: Decomposing finite-valued transducers and deciding their equivalence. SIAM Journal on Computing\u00a022(1), 175\u2013202 (1993)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2012: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27660-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T19:52:03Z","timestamp":1556135523000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27660-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642276590","9783642276606"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27660-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}