{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T08:16:18Z","timestamp":1648800978778},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,8,4]],"date-time":"2016-08-04T00:00:00Z","timestamp":1470268800000},"content-version":"unspecified","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":[[2017,7]]},"DOI":"10.1007\/s00224-016-9682-4","type":"journal-article","created":{"date-parts":[[2016,8,4]],"date-time":"2016-08-04T06:39:22Z","timestamp":1470292762000},"page":"84-155","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Games for Active XML Revisited"],"prefix":"10.1007","volume":"61","author":[{"given":"Martin","family":"Schuster","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Schwentick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,4]]},"reference":[{"issue":"5","key":"9682_CR1","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1007\/s00778-007-0049-y","volume":"17","author":"S Abiteboul","year":"2008","unstructured":"Abiteboul, S., Benjelloun, O., Milo, T.: The active XML project: an overview. VLDB J. 17(5), 1019\u20131040 (2008)","journal-title":"VLDB J."},{"key":"9682_CR2","doi-asserted-by":"crossref","unstructured":"Abiteboul, S., Milo, T., Benjelloun, O.: Regular rewriting of active XML and unambiguity (2005)","DOI":"10.1145\/1065167.1065204"},{"key":"9682_CR3","doi-asserted-by":"crossref","unstructured":"Rajeev, A., Madhusudan, P.: Adding nesting structure to words. J. ACM 56(3) (2009)","DOI":"10.1145\/1516512.1516518"},{"key":"9682_CR4","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, H., Schuster, M., Schwentick, T., Kulbatzki, J.: On optimum left-to-right strategies for active context-free games. In: Joint 2013 EDBT\/ICDT Conferences, ICDT \u201913 Proceedings, Genoa, Italy, March 18-22, 2013, pp. 105\u2013116 (2013)","DOI":"10.1145\/2448496.2448510"},{"key":"9682_CR5","doi-asserted-by":"crossref","unstructured":"Bozzelli, L.: Alternating automata and a temporal fixpoint calculus for visibly pushdown languages. In: CONCUR- Concurrency Theory, 18th International Conference, pp. 476\u2013491 (2007)","DOI":"10.1007\/978-3-540-74407-8_32"},{"key":"9682_CR6","doi-asserted-by":"crossref","unstructured":"Br\u00fcggemann-Klein, A., Wood, D.: Deterministic regular languages. In: STACS 92, 9th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings, pp. 173\u2013184 (1992)","DOI":"10.1007\/3-540-55210-3_182"},{"issue":"1","key":"9682_CR7","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"AK Chandra","year":"1981","unstructured":"Chandra, A.K., Kozen, D., Stockmeyer, L.J.: Alternation. J. ACM 28 (1), 114\u2013133 (1981)","journal-title":"J. ACM"},{"issue":"3","key":"9682_CR8","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/0022-0000(86)90036-X","volume":"32","author":"BS Chlebus","year":"1986","unstructured":"Chlebus, B.S.: Domino-tiling games. J. Comput. Syst. Sci. 32(3), 374\u2013392 (1986)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"9682_CR9","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/1008354.1008356","volume":"9","author":"LM Goldschlager","year":"1977","unstructured":"Goldschlager, L.M.: The monotone and planar circuit value problems are log space complete for P. ACM SIGACT News 9(2), 25\u201329 (1977)","journal-title":"ACM SIGACT News"},{"key":"9682_CR10","doi-asserted-by":"crossref","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. A Guide to Current Research. Springer (2002)","DOI":"10.1007\/3-540-36387-4"},{"issue":"1","key":"9682_CR11","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(76)90068-2","volume":"3","author":"ND Jones","year":"1976","unstructured":"Jones, N.D., Laaser, W.T.: Complete problems for deterministic polynomial time. Theor Comput. Sci. 3(1), 105\u2013117 (1976)","journal-title":"Theor Comput. Sci."},{"key":"9682_CR12","doi-asserted-by":"crossref","unstructured":"Kaiser, L.: Synthesis for structure rewriting systems. In: Rastislav Kr\u00e1lovic and Damian Niwinski, editors, MFCS, volume 5734 of Lecture Notes in Computer Science, pp. 415\u2013426. Springer (2009)","DOI":"10.1007\/978-3-642-03816-7_36"},{"issue":"4","key":"9682_CR13","doi-asserted-by":"crossref","first-page":"1486","DOI":"10.1137\/080743457","volume":"39","author":"W Martens","year":"2009","unstructured":"Martens, W., Neven, F., Schwentick, T.: Complexity of decision problems for XML schemas and chain regular expressions. SIAM J. Comput. 39(4), 1486\u20131530 (2009)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9682_CR14","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., Geert, J.B.: Expressiveness and complexity of XML schema. ACM Trans. Database Syst. 31(3), 770\u2013813 (2006)","journal-title":"ACM Trans. Database Syst."},{"issue":"1","key":"9682_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1061318.1061319","volume":"30","author":"T Milo","year":"2005","unstructured":"Milo, T., Abiteboul, S., Amann, B., Benjelloun, O., Dang Ngoc, F., Exchanging intensional XML data. ACM Trans. Database Syst. 30(1), 1\u201340 (2005)","journal-title":"ACM Trans. Database Syst."},{"issue":"4","key":"9682_CR16","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 Techn. 5(4), 660\u2013704 (2005)","journal-title":"ACM Trans. Internet Techn."},{"issue":"1","key":"9682_CR17","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s00224-005-1278-3","volume":"39","author":"A Muscholl","year":"2006","unstructured":"Muscholl, A., Schwentick, T., Segoufin, L., Active context-free games. Theory Comput. Syst. 39(1), 237\u2013276 (2006)","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"9682_CR18","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1023\/A:1027354826364","volume":"75","author":"M Pauly","year":"2003","unstructured":"Pauly, M., Parikh, R.: Game logic - an overview. Stud. Logica. 75(2), 165\u2013182 (2003)","journal-title":"Stud. Logica."},{"key":"9682_CR19","unstructured":"Schuster, M., Schwentick, T.: Games for active XML revisited. In: 18th International Conference on Database Theory, ICDT 2015, pp. 60\u201375 (2015)"},{"issue":"2","key":"9682_CR20","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1023\/A:1027306910434","volume":"75","author":"VB Johan","year":"2003","unstructured":"Johan, V.B.: Logic games are complete for game logics. Stud. Logica. 75(2), 183\u2013203 (2003)","journal-title":"Stud. Logica."},{"key":"9682_CR21","doi-asserted-by":"crossref","unstructured":"Waldmann, J.: Rewrite games. In: Tison, S. (ed.) RTA, volume 2378 of Lecture Notes in Computer Science, pp. 144\u2013158. Springer (2002)","DOI":"10.1007\/3-540-45610-4_11"},{"issue":"2","key":"9682_CR22","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1006\/inco.2000.2894","volume":"164","author":"I Walukiewicz","year":"2001","unstructured":"Walukiewicz, I.: Pushdown processes: Games and model-checking. Inf. Comput. 164(2), 234\u2013263 (2001)","journal-title":"Inf. Comput."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-016-9682-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-016-9682-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-016-9682-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-016-9682-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T04:21:53Z","timestamp":1568262113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-016-9682-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,4]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["9682"],"URL":"https:\/\/doi.org\/10.1007\/s00224-016-9682-4","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,4]]}}}