{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:44:34Z","timestamp":1725489874814},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540749141"},{"type":"electronic","value":"9783540749158"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74915-8_7","type":"book-chapter","created":{"date-parts":[[2007,8,24]],"date-time":"2007-08-24T05:13:35Z","timestamp":1187932415000},"page":"41-53","source":"Crossref","is-referenced-by-count":4,"title":["Omega-Regular Half-Positional Winning Conditions"],"prefix":"10.1007","author":[{"given":"Eryk","family":"Kopczy\u0144ski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.tcs.2005.10.046","volume":"352","author":"T. Colcombet","year":"2006","unstructured":"Colcombet, T., Niwi\u0144ski, D.: On the positional determinacy of edge-labeled games. Theor. Comput. Sci.\u00a0352, 190\u2013196 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR2","first-page":"368","volume-title":"Proceedings 32th Annual IEEE Symp. on Foundations of Comput. Sci.","author":"E.A. Emerson","year":"1991","unstructured":"Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus and determinacy. In: Proceedings 32th Annual IEEE Symp. on Foundations of Comput. Sci., pp. 368\u2013377. IEEE Computer Society Press, Los Alamitos (1991)"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/978-3-540-24749-4_2","volume-title":"STACS 2004","author":"E. Gr\u00e4del","year":"2004","unstructured":"Gr\u00e4del, E.: Positional Determinacy of Infinite Games. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 4\u201318. Springer, Heidelberg (2004)"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Logics, and Infinite Games","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol.\u00a02500. Springer, Heidelberg (2002)"},{"issue":"4:6","key":"7_CR5","first-page":"1","volume":"2","author":"E. Gr\u00e4del","year":"2006","unstructured":"Gr\u00e4del, E., Walukiewicz, I.: Positional determinacy of games with infinitely many priorities. Logical Methods in Computer Science\u00a02(4:6), 1\u201322 (2006)","journal-title":"Logical Methods in Computer Science"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1007\/978-3-540-28629-5_53","volume-title":"Mathematical Foundations of Computer Science 2004","author":"H. Gimbert","year":"2004","unstructured":"Gimbert, H., Zielonka, W.: When can you play positionally? In: Fiala, J., Koubek, V., Kratochv\u00edl, J. (eds.) MFCS 2004. LNCS, vol.\u00a03153, pp. 686\u2013697. Springer, Heidelberg (2004)"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/11539452_33","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"H. Gimbert","year":"2005","unstructured":"Gimbert, H., Zielonka, W.: Games Where You Can Play Optimally Without Any Memory. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 428\u2013442. Springer, Heidelberg (2005)"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Klarlund, N.: Progress measures, immediate determinacy, and a subset construction for tree automata. In: Proc. 7th IEEE Symp. on Logic in Computer Science (1992)","DOI":"10.1109\/LICS.1992.185550"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/11787006_29","volume-title":"Automata, Languages and Programming","author":"E. Kopczy\u0144ski","year":"2006","unstructured":"Kopczy\u0144ski, E.: Half-Positional Determinacy of Infinite Games. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 336\u2013347. Springer, Heidelberg (2006)"},{"key":"7_CR10","unstructured":"Kopczy\u0144ski, E.: Half-positional determinacy of infinite games. Draft. \n                    \n                      http:\/\/www.mimuw.edu.pl\/~erykk\/papers\/hpwc.ps"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"363","DOI":"10.2307\/1971035","volume":"102","author":"D.A. Martin","year":"1975","unstructured":"Martin, D.A.: Borel determinacy. Ann. Math.\u00a0102, 363\u2013371 (1975)","journal-title":"Ann. Math."},{"key":"7_CR12","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, 149\u2013184 (1993)","journal-title":"Annals of Pure and Applied Logic"},{"key":"7_CR13","unstructured":"Mostowski, A.W.: Games with forbidden positions. Technical Report 78, Uniwersytet Gda\u0144ski, Instytut Matematyki (1991)"},{"issue":"1-2","key":"7_CR14","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. Theor. Comp. Sci.\u00a0200(1-2), 135\u2013183 (1998)","journal-title":"Theor. Comp. Sci."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74915-8_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:45:58Z","timestamp":1619520358000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74915-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540749141","9783540749158"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74915-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}