{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T09:37:28Z","timestamp":1648978648255},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,3,28]],"date-time":"2015-03-28T00:00:00Z","timestamp":1427500800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s00224-015-9611-y","type":"journal-article","created":{"date-parts":[[2015,3,28]],"date-time":"2015-03-28T19:29:40Z","timestamp":1427570980000},"page":"1250-1321","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Which XML Schemas are Streaming Bounded Repairable?"],"prefix":"10.1007","volume":"57","author":[{"given":"Pierre","family":"Bourhis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriele","family":"Puppis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cristian","family":"Riveros","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,28]]},"reference":[{"issue":"3","key":"9611_CR1","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/j.ipl.2006.06.002","volume":"100","author":"T Akutsu","year":"2006","unstructured":"Akutsu, T.: A relation between edit distance for ordered trees and edit distance for euler strings. Inf. Process. Lett. 100(3), 105\u2013109 (2006)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"9611_CR2","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/1516512.1516518","volume":"56","author":"R Alur","year":"2009","unstructured":"Alur, R., Madhusudan, P.: Adding nesting structure to words. J. ACM 56(3), 16 (2009)","journal-title":"J. ACM"},{"key":"9611_CR3","unstructured":"Baier, C., Katoen, J.P.: Principles of model checking. MIT press Cambridge (2008)"},{"key":"9611_CR4","doi-asserted-by":"crossref","unstructured":"Benedikt, M., Puppis, G., Riveros, C.: The cost of traveling between languages. In: automata, languages and programming (ICALP) pp. 234\u2013245 (2011)","DOI":"10.1007\/978-3-642-22012-8_18"},{"key":"9611_CR5","doi-asserted-by":"crossref","unstructured":"Benedikt, M., Puppis, G., Riveros, C.: Regular repair of specifications. In: Proceedings of the 26th Annual IEEE Symposium On Logic in Computer Science (LICS), pp. 335\u2013344 (2011)","DOI":"10.1109\/LICS.2011.43"},{"issue":"8","key":"9611_CR6","doi-asserted-by":"crossref","first-page":"1302","DOI":"10.1016\/j.jcss.2013.06.001","volume":"79","author":"M Benedikt","year":"2013","unstructured":"Benedikt, M., Puppis, G., Riveros, C.: Bounded repairability of word languages. J. Comput. Syst. Sci. 79(8), 1302\u20131321 (2013)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"9611_CR7","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/j.tcs.2004.12.030","volume":"337","author":"P Bille","year":"2005","unstructured":"Bille, P.: A survey on tree edit distance and related problems. Theor. Comput. Sci. 337(1), 217\u2013239 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"9611_CR8","unstructured":"Boas, P.V.E. Complexity, Logic, and Recursion Theory, pp. 331\u2013363: The convenience of tilings (1997)"},{"issue":"2","key":"9611_CR9","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1006\/inco.1997.2695","volume":"142","author":"A Br\u00fcggemann-Klein","year":"1998","unstructured":"Br\u00fcggemann-Klein, A., Wood, D.: One-unambiguous regular languages. Inf. Comput. 142(2), 182\u2013206 (1998)","journal-title":"Inf. Comput."},{"key":"9611_CR10","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":"9611_CR11","doi-asserted-by":"crossref","unstructured":"Cristau, J., L\u00f6ding, C., Thomas, W.: Deterministic automata on unranked trees. In: fundamentals of computation theory, pp. 68\u201379 (2005)","DOI":"10.1007\/11537311_7"},{"issue":"1","key":"9611_CR12","doi-asserted-by":"crossref","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. Inf. Process. Lett. 109(1), 13\u201317 (2008)","journal-title":"Inf. Process. Lett."},{"key":"9611_CR13","doi-asserted-by":"crossref","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T.: Automata, logics, and infinite games: a guide to current research, vol. 2500. Springer, New York (2003)","DOI":"10.1007\/3-540-36387-4"},{"key":"9611_CR14","doi-asserted-by":"crossref","unstructured":"Kumar, V., Madhusudan, P., Viswanathan, M.: Visibly pushdown automata for streaming XML. In: Proceedings of the 16th International Conference On World Wide Web (WWW), pp. 1053\u20131062 (2007)","DOI":"10.1145\/1242572.1242714"},{"key":"9611_CR15","unstructured":"Martens, W., Neven, F., Schwentick, T.: Deterministic top-down tree automata: past, present, and future. In: Logic And Automata: History And Perspectives Texts In Logic And Games, vol. 2, pp 505\u2013530 (2008)"},{"issue":"3","key":"9611_CR16","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1145\/1166074.1166076","volume":"31","author":"W Martens","year":"2006","unstructured":"Martens, W., Neven, F., Schwentick, T., Bex, G.J.: Expressiveness and complexity of XML schema. ACM Trans. Database Syst. 31(3), 770\u2013813 (2006)","journal-title":"ACM Trans. Database Syst."},{"issue":"4","key":"9611_CR17","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1145\/1111627.1111631","volume":"5","author":"M Murata","year":"2005","unstructured":"Murata, M., Lee, D., Mani, M., Kawaguchi, K.: Taxonomy of XML schema languages using formal language theory. ACM Trans. Internet Technol. 5(4), 660\u2013704 (2005)","journal-title":"ACM Trans. Internet Technol."},{"key":"9611_CR18","doi-asserted-by":"crossref","unstructured":"Puppis, G., Riveros, C., Staworko, S.: Bounded repairability for regular tree languages. In: Proceedings of the 15th International Conference on Database Theory (ICDT), pp. 155\u2013168 (2012)","DOI":"10.1145\/2274576.2274593"},{"key":"9611_CR19","doi-asserted-by":"crossref","unstructured":"Segoufin, L., Vianu, V.: Validating streaming XML documents. In: Proceedings of the 21th ACM SIGMOD Symposium on Principles of Database Systems (PODS), pp. 53\u201364 (2002)","DOI":"10.1145\/543613.543622"},{"issue":"3","key":"9611_CR20","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"KC Tai","year":"1979","unstructured":"Tai, K.C.: The tree-to-tree correction problem. J. ACM 26(3), 422\u2013433 (1979)","journal-title":"J. ACM"},{"issue":"1","key":"9611_CR21","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R Wagner","year":"1974","unstructured":"Wagner, R., Fischer, M.: The string-to-string correction problem. J. ACM 21(1), 168\u2013173 (1974)","journal-title":"J. ACM"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-015-9611-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-015-9611-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-015-9611-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T10:37:07Z","timestamp":1566470227000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-015-9611-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,28]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["9611"],"URL":"https:\/\/doi.org\/10.1007\/s00224-015-9611-y","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,28]]}}}