{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T18:43:16Z","timestamp":1794336196929,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540287025","type":"print"},{"value":"9783540318675","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11549345_43","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T10:05:47Z","timestamp":1127815547000},"page":"495-506","source":"Crossref","is-referenced-by-count":26,"title":["Complexity Bounds for Regular Games"],"prefix":"10.1007","author":[{"given":"Paul","family":"Hunter","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anuj","family":"Dawar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"43_CR1","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1090\/S0002-9947-1969-0280205-0","volume":"138","author":"J.R. B\u00fcchi","year":"1969","unstructured":"B\u00fcchi, J.R., Landweber, L.H.: Solving sequential conditions by finite-state strategies. Trans. Amer. Math. Soc.\u00a0138, 295\u2013311 (1969)","journal-title":"Trans. Amer. Math. Soc."},{"key":"43_CR2","doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Jurdzi\u0144ski, M., Walukiewicz, I.: How much memory is needed to win infinite games? In: Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science, pp. 99\u2013110 (1997)","DOI":"10.1109\/LICS.1997.614939"},{"key":"43_CR3","doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Jutla, C.S.: The complexity of tree automata and logics of programs (extended abstract). In: Proceedings for the 29th IEEE Symposium on Foundations of Computer Science, pp. 328\u2013337 (1988)","DOI":"10.1109\/SFCS.1988.21949"},{"key":"43_CR4","doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Lei, C.-L.: Modalities for model checking: Branching time strikes back. In: Proceedings of the 12th Annual ACM Symposium on Principles of Porgramming Languages, pp. 84\u201396 (1985)","DOI":"10.1145\/318593.318620"},{"key":"43_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36387-4","volume-title":"Automata, Logics, and Infinite Games","author":"E. Gr\u00e4del","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T.: Automata, Logics, and Infinite Games. LNCS, vol.\u00a02500. Springer, Heidelberg (2002)"},{"key":"43_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/3-540-36379-3_24","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"H. Ishihara","year":"2002","unstructured":"Ishihara, H., Khoussainov, B.: Complexity of some infinite games played on finite graphs. In: Ku\u010dera, L. (ed.) WG 2002. LNCS, vol.\u00a02573, pp. 270\u2013281. Springer, Heidelberg (2002)"},{"key":"43_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/3-540-47813-2_17","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"S. Torre La","year":"2002","unstructured":"La Torre, S., Murano, A., Napoli, M.: Weak muller acceptance conditions for tree automata. In: Cortesi, A. (ed.) VMCAI 2002. LNCS, vol.\u00a02294, pp. 240\u2013254. Springer, Heidelberg (2002)"},{"key":"43_CR8","unstructured":"McNaughton, R.: Finite-state infinite games. Technical report, Project MAC, Massachusetts Institute of Technology, USA (1965)"},{"issue":"2","key":"43_CR9","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0168-0072(93)90036-D","volume":"65","author":"R. McNaughton","year":"1993","unstructured":"McNaughton, R.: Infinite games played on finite graphs. Annals of Pure and Applied Logic\u00a065(2), 149\u2013184 (1993)","journal-title":"Annals of Pure and Applied Logic"},{"issue":"1-3","key":"43_CR10","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0168-0072(95)00032-1","volume":"78","author":"A. Nerode","year":"1996","unstructured":"Nerode, A., Remmel, J.B., Yakhnis, A.: McNaughton games and extracting strategies for concurrent programs. Annals of Pure and Applied Logic\u00a078(1-3), 203\u2013242 (1996)","journal-title":"Annals of Pure and Applied Logic"},{"key":"43_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-540-45069-6_7","volume-title":"Computer Aided Verification","author":"J. Obdr\u017e\u00e1lek","year":"2003","unstructured":"Obdr\u017e\u00e1lek, J.: Fast mu-calculus model checking when tree-width is bounded. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 80\u201392. Springer, Heidelberg (2003)"},{"key":"43_CR12","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(98)00009-7","volume":"200","author":"W. Zielonka","year":"1998","unstructured":"Zielonka, W.: Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theoretical Computer Science\u00a0200, 135\u2013183 (1998)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11549345_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:41:18Z","timestamp":1605624078000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11549345_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540287025","9783540318675"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11549345_43","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11549345","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}