乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T19:33:21Z","timestamp":1725824001514},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476659"},{"type":"electronic","value":"9783662476666"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47666-6_36","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T07:46:47Z","timestamp":1434700007000},"page":"452-463","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["How Much Lookahead is Needed to Win Infinite Games?"],"prefix":"10.1007","author":[{"given":"Felix","family":"Klein","sequence":"first","affiliation":[]},{"given":"Martin","family":"Zimmermann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"36_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1090\/S0002-9947-1969-0280205-0","volume":"138","author":"JR B\u00fcchi","year":"1969","unstructured":"B\u00fcchi, J.R., Landweber, L.H.: Solving sequential conditions by finite-state strategies. Trans. Amer. Math. Soc. 138, 295\u2013311 (1969)","journal-title":"Trans. Amer. Math. Soc."},{"key":"36_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-540-74915-8_15","volume-title":"Computer Science Logic","author":"A Carayol","year":"2007","unstructured":"Carayol, A., L\u00f6ding, C.: MSO on the infinite binary tree: choice and order. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol. 4646, pp. 161\u2013176. Springer, Heidelberg (2007)"},{"unstructured":"Carayol, A., L\u00f6ding, C.: Uniformization in automata theory. In: Schroeder-Heister, P., Heinzmann, G., Hodges, W., Bour, P.E. (eds.) CLMPS. College Publications, London (2012) (to appear)","key":"36_CR3"},{"issue":"1","key":"36_CR4","doi-asserted-by":"publisher","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"},{"unstructured":"Fridman, W., L\u00f6ding, C., Zimmermann, M.: Degrees of lookahead in context-free infinite games. In: Bezem, M. (ed.) CSL 2011. LIPIcs, vol. 12, pp. 264\u2013276. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2011)","key":"36_CR5"},{"key":"36_CR6","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.2307\/2273673","volume":"48","author":"Y Gurevich","year":"1983","unstructured":"Gurevich, Y., Shelah, S.: Rabin\u2019s uniformization problem. The Journal of Symbolic Logic 48, 1105\u20131119 (1983)","journal-title":"The Journal of Symbolic Logic"},{"doi-asserted-by":"crossref","unstructured":"Holtmann, M., Kaiser, L., Thomas, W.: Degrees of lookahead in regular infinite games. LMCS 8(3) (2012)","key":"36_CR7","DOI":"10.2168\/LMCS-8(3:24)2012"},{"unstructured":"Hosch, F.A., Landweber, L.H.: Finite delay solutions for sequential conditions. In: ICALP 1972, pp. 45\u201360 (1972)","key":"36_CR8"},{"doi-asserted-by":"crossref","unstructured":"Hutagalung, M., Lange, M., Lozes, \u00c9.: Buffered simulation games for B\u00fcchi automata. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) AFL 2014. EPTCS, vol. 151, pp. 286\u2013300 (2014)","key":"36_CR9","DOI":"10.4204\/EPTCS.151.20"},{"doi-asserted-by":"crossref","unstructured":"Klein, F., Zimmermann, M.: How much lookahead is needed to win infinite games? (2014). arXiv: 1412.3701","key":"36_CR10","DOI":"10.1007\/978-3-662-47666-6_36"},{"unstructured":"Klein, F., Zimmermann, M.: What are strategies in delay games? Borel determinacy for games with lookahead (2015). arXiv: 1504.02627","key":"36_CR11"},{"doi-asserted-by":"crossref","unstructured":"L\u00f6ding, C., Winter, S.: Synthesis of deterministic top-down tree transducers from automatic tree relations. In: Peron, A., Piazza, C. (eds.) GandALF 2014. EPTCS, vol. 161, pp. 88\u2013101 (2014)","key":"36_CR12","DOI":"10.4204\/EPTCS.161.10"},{"key":"36_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-540-77050-3_37","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"S Schewe","year":"2007","unstructured":"Schewe, S.: Solving parity games in big steps. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol. 4855, pp. 449\u2013460. Springer, Heidelberg (2007)"},{"key":"36_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/3-540-58043-3_29","volume-title":"A Decade of Concurrency","author":"W Thomas","year":"1994","unstructured":"Thomas, W., Lescow, H.: Logical specifications of infinite computations. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1993. LNCS, vol. 803, pp. 583\u2013621. Springer, Heidelberg (1994)"},{"unstructured":"Trakhtenbrot, B., Barzdin, I.: Finite Automata; Behavior and Synthesis. Fundamental Studies in Computer Science, vol. 1. North-Holland Publishing Company, New York. American Elsevier (1973)","key":"36_CR15"},{"doi-asserted-by":"crossref","unstructured":"Zimmermann, M.: Delay games with WMSO+U winning conditions. In: CSR 2015 (2015, to appear). arXiv: 1412.3978","key":"36_CR16","DOI":"10.1007\/978-3-319-20297-6_26"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47666-6_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T21:53:16Z","timestamp":1676584396000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47666-6_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476659","9783662476666"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47666-6_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}