{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:08:04Z","timestamp":1725538084492},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642034084"},{"type":"electronic","value":"9783642034091"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03409-1_17","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:05:18Z","timestamp":1252937118000},"page":"181-192","source":"Crossref","is-referenced-by-count":1,"title":["Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies"],"prefix":"10.1007","author":[{"given":"Paul","family":"H\u00e4nsch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michaela","family":"Slaats","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"Thomas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"27","key":"17_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1090\/S0002-9947-1969-0280205-0","volume":"138","author":"R. B\u00fcchi","year":"1969","unstructured":"B\u00fcchi, R., Landweber, L.: Solving sequential conditions by finite state strategies. Transactions of the AMS\u00a0138(27), 295\u2013311 (1969)","journal-title":"Transactions of the AMS"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/11549345_16","volume-title":"Mathematical Foundations of Computer Science 2005","author":"A. Carayol","year":"2005","unstructured":"Carayol, A.: Regular sets of higher-order pushdown stacks. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 168\u2013179. Springer, Heidelberg (2005)"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-540-24597-1_10","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"A. Carayol","year":"2003","unstructured":"Carayol, A., W\u00f6hrle, S.: The Caucal hierarchy of infinite graphs in terms of logic and higher-order pushdown automata. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.\u00a02914, pp. 112\u2013123. Springer, Heidelberg (2003)"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-540-85238-4_17","volume-title":"Mathematical Foundations of Computer Science 2008","author":"A. Carayol","year":"2008","unstructured":"Carayol, A., Slaats, M.: Positional strategies for higher-order pushdown parity games. In: Ochma\u0144ski, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol.\u00a05162, pp. 217\u2013228. Springer, Heidelberg (2008)"},{"issue":"1","key":"17_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1006\/inco.2001.3139","volume":"176","author":"O. Carton","year":"2002","unstructured":"Carton, O., Thomas, W.: The monadic theory of morphic infinite words and generalizations. Inf. Comput.\u00a0176(1), 51\u201365 (2002)","journal-title":"Inf. Comput."},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/3-540-45687-2_13","volume-title":"Mathematical Foundations of Computer Science 2002","author":"D. Caucal","year":"2002","unstructured":"Caucal, D.: On infinite graphs having a decidable monadic theory. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol.\u00a02420, pp. 165\u2013176. Springer, Heidelberg (2002)"},{"key":"17_CR7","unstructured":"Fratani, S.: Automates \u00e1 piles depiles ... de piles. PhD thesis, Universit\u00e9 Bordeaux 1 (2005)"},{"key":"17_CR8","volume-title":"Contributions to the Theory of Games","author":"D. Gale","year":"1953","unstructured":"Gale, D., Stewart, F.M.: Infinite games with perfect information. In: Contributions to the Theory of Games. Princeton University Press, Princeton (1953)"},{"key":"17_CR9","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":"17_CR10","unstructured":"H\u00e4nsch, P.: Infinite games with parameters. Master\u2019s thesis, Lehrstuhl f\u00fcr Informatik 7, RWTH Aachen, Aachen, Germany (2009)"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","volume":"9","author":"R. McNaughton","year":"1966","unstructured":"McNaughton, R.: Testing and generating infinite sequences by a finite automaton. Inform. Contr.\u00a09, 521\u2013530 (1966)","journal-title":"Inform. Contr."},{"key":"17_CR12","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)"},{"issue":"4:9","key":"17_CR13","first-page":"1","volume":"3","author":"A. Rabinovich","year":"2007","unstructured":"Rabinovich, A.: Church synthesis problem with parameters. Logical Methods in Computer Science\u00a03(4:9), 1\u201324 (2007)","journal-title":"Logical Methods in Computer Science"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1007\/11874683_37","volume-title":"Computer Science Logic","author":"A. Rabinovich","year":"2006","unstructured":"Rabinovich, A., Thomas, W.: Decidable theories of the ordering of natural number with unary predicates. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 562\u2013574. Springer, Heidelberg (2006)"},{"key":"17_CR15","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers","year":"1967","unstructured":"Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967)"},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF02280817","volume":"17","author":"D. Siefkes","year":"1975","unstructured":"Siefkes, D.: The recursive sets in certain monadic second order fragments of arithmetic. Archiv math. Logik\u00a017, 71\u201380 (1975)","journal-title":"Archiv math. Logik"},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF01351676","volume":"237","author":"W. Thomas","year":"1978","unstructured":"Thomas, W.: The theory of successor with an extra predicate. Math. Ann.\u00a0237, 121\u2013132 (1978)","journal-title":"Math. Ann."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03409-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T19:08:10Z","timestamp":1552158490000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03409-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642034084","9783642034091"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03409-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}