{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:44:46Z","timestamp":1725489886662},"publisher-location":"Berlin, Heidelberg","reference-count":21,"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_9","type":"book-chapter","created":{"date-parts":[[2007,8,24]],"date-time":"2007-08-24T05:13:35Z","timestamp":1187932415000},"page":"69-83","source":"Crossref","is-referenced-by-count":4,"title":["Logical Refinements of Church\u2019s Problem"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Rabinovich","sequence":"first","affiliation":[]},{"given":"Wolfgang","family":"Thomas","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"367","DOI":"10.2307\/1994916","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, 367\u2013378 (1969)","journal-title":"Trans. Amer. Math. Soc."},{"key":"9_CR2","first-page":"98","volume":"5","author":"J.R. B\u00fcchi","year":"1958","unstructured":"B\u00fcchi, J.R., Elgot, C.C., Wright, J.B.: The nonexistence of certain algorithms of finite automata theory. Notices of the AMS\u00a05, 98 (1958)","journal-title":"Notices of the AMS"},{"key":"9_CR3","unstructured":"Church, A.: Logic, arithmetic, and automata. In: Proc. Int. Congr. Math. 1962, Inst. Mittag-Lefler, Djursholm, Sweden, pp. 23\u201335 (1963)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Jurdzi\u0144ski, M., Walukiewicz, I.: How much memory is needed to win infinite games? In: Proc. 12th LICS, pp. 99\u2013110 (1997)","DOI":"10.1109\/LICS.1997.614939"},{"key":"9_CR5","volume-title":"Finite Model Theory","author":"H.D. Ebbinghaus","year":"1995","unstructured":"Ebbinghaus, H.D., Flum, J.: Finite Model Theory. Springer, Heidelberg (1995)"},{"key":"9_CR6","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)"},{"key":"9_CR7","first-page":"60","volume-title":"Proc. 14th STOC","author":"Y. Gurevich","year":"1982","unstructured":"Gurevich, Y., Harrington, L.: Trees, automata, and games. In: Proc. 14th STOC, pp. 60\u201365. ACM Press, New York (1982)"},{"key":"9_CR8","first-page":"479","volume-title":"Model Theoretic Logics","author":"Y. Gurevich","year":"1986","unstructured":"Gurevich, Y.: Monadic second order theories. In: Barwise, J., Feferman, S. (eds.) Model Theoretic Logics, pp. 479\u2013506. Springer, Heidelberg (1986)"},{"key":"9_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/3-540-45653-8_2","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"O. Kupferman","year":"2001","unstructured":"Kupferman, O., Vardi, M.Y.: On Bounded Specifications. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol.\u00a02250, pp. 24\u201338. Springer, Heidelberg (2001)"},{"key":"9_CR10","volume-title":"Descriptive Set Theory","author":"Y. Moschovakis","year":"1980","unstructured":"Moschovakis, Y.: Descriptive Set Theory. North-Holland, Amsterdam (1980)"},{"key":"9_CR11","volume-title":"Infinite Words","author":"D. Perrin","year":"2004","unstructured":"Perrin, D., Pin, J.E.: Infinite Words. Elsevier, Amsterdam (2004)"},{"key":"9_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-2215-3","volume-title":"Varieties of Formal Languages","author":"J.E. Pin","year":"1986","unstructured":"Pin, J.E.: Varieties of Formal Languages. North Oxford and Pergamon, Oxford (1986)"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"39","DOI":"10.2307\/2964057","volume":"22","author":"H. Putnam","year":"1957","unstructured":"Putnam, H.: Decidability and essential undecidability. JSL\u00a022, 39\u201354 (1957)","journal-title":"JSL"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/11874683_36","volume-title":"Computer Science Logic","author":"A. Rabinovich","year":"2006","unstructured":"Rabinovich, A.: Church Synthesis Problem with Parameters. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 546\u2013561. Springer, Heidelberg (2006)"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","volume-title":"DLT 2007","author":"V. Selivanov","year":"2007","unstructured":"Selivanov, V.: Fine hierarchy of regular aperiodic \u00fa- languages. In: Harju, T., et al. (eds.) DLT 2007. LNCS, vol.\u00a04588, Springer, Heidelberg (2007)"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"349","DOI":"10.2307\/1971037","volume":"102","author":"S. Shelah","year":"1975","unstructured":"Shelah, S.: The monadic theory of order. Ann. of Math.\u00a0102, 349\u2013419 (1975)","journal-title":"Ann. of Math."},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Straubing, H.: Finite Automata, Formal Logic, and Circuit Complexity, Birkh\u00e4user, Boston (1994)","DOI":"10.1007\/978-1-4612-0289-9"},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0019-9958(81)90663-X","volume":"48","author":"W. Thomas","year":"1981","unstructured":"Thomas, W.: A combinatorial approach to the theory of \u03c9-automata. Inf. Contr.\u00a048, 261\u2013283 (1981)","journal-title":"Inf. Contr."},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-60275-5","volume-title":"STACS 1995","author":"W. Thomas","year":"1995","unstructured":"Thomas, W.: On the synthesis of strategies in infinite games. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol.\u00a0900, pp. 1\u201313. Springer, Heidelberg (1995)"},{"key":"9_CR20","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume-title":"Handbook of Formal Languages","author":"W. Thomas","year":"1997","unstructured":"Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a03, pp. 389\u2013455. Springer, Heidelberg (1997)"},{"key":"9_CR21","first-page":"109","volume-title":"Contributions on Theoretical Computer Science in Honor of Arto Salomaa","author":"W. Thomas","year":"1999","unstructured":"Thomas, W.: Complementation of B\u00fcchi automata revisited. In: Contributions on Theoretical Computer Science in Honor of Arto Salomaa, pp. 109\u2013120. Springer, Heidelberg (1999)"}],"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_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:46:02Z","timestamp":1619520362000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74915-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540749141","9783540749158"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74915-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}