{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T05:46:23Z","timestamp":1751348783603},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642120312"},{"type":"electronic","value":"9783642120329"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12032-9_18","type":"book-chapter","created":{"date-parts":[[2010,3,8]],"date-time":"2010-03-08T01:07:56Z","timestamp":1268010476000},"page":"252-266","source":"Crossref","is-referenced-by-count":12,"title":["Degrees of Lookahead in Regular\u00a0Infinite\u00a0Games"],"prefix":"10.1007","author":[{"given":"Michael","family":"Holtmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u0141ukasz","family":"Kaiser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"Thomas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","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":"18_CR2","doi-asserted-by":"publisher","first-page":"295","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. Transactions of the AMS\u00a0138, 295\u2013311 (1969)","journal-title":"Transactions of the AMS"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/3-540-61474-5_58","volume-title":"Computer Aided Verification","author":"I. Walukiewicz","year":"1996","unstructured":"Walukiewicz, I.: Pushdown processes: Games and model checking. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol.\u00a01102, pp. 62\u201374. Springer, Heidelberg (1996)"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1007\/3-540-45061-0_45","volume-title":"Automata, Languages and Programming","author":"T. Cachat","year":"2003","unstructured":"Cachat, T.: Higher order pushdown automata, the caucal hierarchy of graphs and parity games. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 556\u2013569. Springer, Heidelberg (2003)"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/978-3-540-24597-1_8","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"A.J. Bouquet","year":"2003","unstructured":"Bouquet, A.J., Serre, O., Walukiewicz, I.: Pushdown games with unboundedness and regular conditions. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.\u00a02914, pp. 88\u201399. Springer, Heidelberg (2003)"},{"key":"18_CR6","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Descriptive Set Theory","author":"Y.N. Moschovakis","year":"1980","unstructured":"Moschovakis, Y.N.: Descriptive Set Theory. Studies in Logic and the Foundations of Mathematics, vol.\u00a0100. North-Holland Publishing Company, Amsterdam (1980)"},{"key":"18_CR7","volume-title":"Finite Automata, Behavior and Synthesis","author":"B.A. Trakhtenbrot","year":"1973","unstructured":"Trakhtenbrot, B.A., Barzdin, Y.M.: Finite Automata, Behavior and Synthesis. North Holland, Amsterdam (1973)"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.\u00a0803, pp. 583\u2013621. Springer, Heidelberg (1994)"},{"key":"18_CR9","first-page":"45","volume-title":"Automata, Languages and Programming, Paris, France","author":"F.A. Hosch","year":"1972","unstructured":"Hosch, F.A., Landweber, L.H.: Finite delay solutions for sequential conditions. In: Nivat, M. (ed.) Automata, Languages and Programming, Paris, France, pp. 45\u201360. North-Holland, Amsterdam (1972)"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1109\/T-C.1969.222636","volume":"C-18","author":"S. Even","year":"1969","unstructured":"Even, S., Meyer, A.: Sequential boolean equations. IEEE Transactions on Computers\u00a0C-18, 230\u2013240 (1969)","journal-title":"IEEE Transactions on Computers"},{"key":"18_CR11","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/978-94-011-0149-3_3","volume-title":"NATO Advanced Study Institute Semigroups, Formal Language and Groups","author":"D. Perrin","year":"1995","unstructured":"Perrin, D., Pin, J.: Semigroups and automata on infinite words. In: Fountain, J. (ed.) NATO Advanced Study Institute Semigroups, Formal Language and Groups, pp. 49\u201372. Kluwer Academic Publishers, Dordrecht (1995)"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Pin, J.: Finite semigroups and recognizable languages: An introduction (1995)","DOI":"10.1007\/978-94-011-0149-3_1"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0022-0000(78)90019-3","volume":"16","author":"R.S. Cohen","year":"1978","unstructured":"Cohen, R.S., Gold, A.Y.: Omega-computations on deterministic pushdown machines. Journal of Computer and System Sciences\u00a016, 275\u2013300 (1978)","journal-title":"Journal of Computer and System Sciences"},{"key":"18_CR14","first-page":"669","volume":"262","author":"O. Finkel","year":"2001","unstructured":"Finkel, O.: Topological properties of omega context-free languages. Theoretical\u00a0Computer\u00a0Science\u00a0262, 669\u2013697 (2001)","journal-title":"Theoretical\u00a0Computer\u00a0Science"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12032-9_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:47:00Z","timestamp":1606186020000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12032-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642120312","9783642120329"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12032-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}