{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T20:40:01Z","timestamp":1748464801910,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662477083"},{"type":"electronic","value":"9783662477090"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47709-0_8","type":"book-chapter","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T07:07:37Z","timestamp":1435043257000},"page":"93-108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Weak Index Problem for Game Automata"],"prefix":"10.1007","author":[{"given":"Alessandro","family":"Facchini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Filip","family":"Murlak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u0142","family":"Skrzypczak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"key":"8_CR1","unstructured":"Arnold, A., Niwi\u0144ski, D.: Fixed point characterisation of weak monadic logic definable sets of trees. In: Tree Automata and Languages, pp. 159\u2013188 (1992)"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/3-540-61604-7_58","volume-title":"CONCUR 1996: Concurrency Theory","author":"JC Bradfield","year":"1996","unstructured":"Bradfield, J.C.: The modal mu-calculus alternation hierarchy is strict. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 233\u2013246. Springer, Heidelberg (1996)"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Bernholtz, O., Vardi, M.Y., Wolper, P.: An automata-theoretic approach to branching-time model checking (extended abstract). In: CAV, pp. 142\u2013155 (1994)","DOI":"10.1007\/3-540-58179-0_50"},{"key":"8_CR4","unstructured":"Duparc, J., Facchini, A., Murlak, F.: Definable operations on weakly recognizable sets of trees. In: FSTTCS, pp. 363\u2013374 (2011)"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-540-74240-1_23","volume-title":"Fundamentals of Computation Theory","author":"J Duparc","year":"2007","unstructured":"Duparc, J., Murlak, F.: On the topological complexity of weakly recognizable tree languages. In: Csuhaj-Varj\u00fa, E., \u00c9sik, Z. (eds.) FCT 2007. LNCS, vol. 4639, pp. 261\u2013273. Springer, Heidelberg (2007)"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Emerson, A., Jutla, C.: Tree automata, mu-calculus and determinacy. In: FOCS 1991, pp. 368\u2013377 (1991)","DOI":"10.1109\/SFCS.1991.185392"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Facchini, A., Murlak, F., Skrzypczak, M.: Rabin-Mostowski index problem: a step beyond deterministic automata. In: LICS, pp. 499\u2013508 (2013)","DOI":"10.1109\/LICS.2013.56"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/3-540-49116-3_43","volume-title":"STACS 1999","author":"O Kupferman","year":"1999","unstructured":"Kupferman, O., Vardi, M.Y.: The weakness of self-complementation. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, p. 455. Springer, Heidelberg (1999)"},{"key":"8_CR9","unstructured":"Mostowski, A.W.: Games with Forbidden Positions. Technical report, University of Gda\u0144sk (1991)"},{"issue":"2","key":"8_CR10","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0304-3975(91)90283-8","volume":"83","author":"AW Mostowski","year":"1991","unstructured":"Mostowski, A.W.: Hierarchies of weak automata and weak monadic formulas. Theor. Comput. Sci. 83(2), 323\u2013335 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/3-540-16761-7_77","volume-title":"Automata, Languages and Programming","author":"DE Muller","year":"1986","unstructured":"Muller, D.E., Saoudi, A., Schupp, P.E.: Alternating automata, the weak monadic theory of the tree, and its complexity. In: Kott, L. (ed.) Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 226, pp. 275\u2013283. Springer, Heidelberg (1986)"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/11538363_30","volume-title":"Computer Science Logic","author":"F Murlak","year":"2005","unstructured":"Murlak, F.: On deciding topological classes of deterministic tree languages. In: Ong, L. (ed.) CSL 2005. LNCS, vol. 3634, pp. 428\u2013441. Springer, Heidelberg (2005)"},{"key":"8_CR13","unstructured":"Murlak, F.: Weak index versus Borel rank. In: STACS 2008, LIPIcs, vol. 1, pp. 573\u2013584 (2008)"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/3-540-16761-7_96","volume-title":"Automata, Languages and Programming","author":"D Niwi\u0144ski","year":"1986","unstructured":"Niwi\u0144ski, D.: On fixed-point clones. In: Kott, L. (ed.) Automata, Languages and Programming. LNCS, vol. 226, pp. 464\u2013473. Springer, Berlin Heidelberg (1986)"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/BFb0028571","volume-title":"STACS 1998","author":"D Niwi\u0144ski","year":"1998","unstructured":"Niwi\u0144ski, D., Walukiewicz, I.: Relating hierarchies of word and tree automata. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol. 1373, pp. 320\u2013331. Springer, Heidelberg (1998)"},{"issue":"303","key":"8_CR16","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0304-3975(02)00452-8","volume":"1","author":"D Niwi\u0144ski","year":"2003","unstructured":"Niwi\u0144ski, D., Walukiewicz, I.: A gap property of deterministic tree languages. Theor. Comput. Sci. 1(303), 215\u2013231 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.entcs.2004.05.015","volume":"123","author":"D Niwi\u0144ski","year":"2005","unstructured":"Niwi\u0144ski, D., Walukiewicz, I.: Deciding nondeterministic hierarchy of deterministic tree automata. Electr. Notes Theor. Comput. Sci. 123, 195\u2013208 (2005)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Rabin, M.O.: Weakly definable relations and special automata. In: Proceedings of the Symposium on Mathematical Logic and Foundations of Set Theory, North-Holland, pp. 1\u201323 (1970)","DOI":"10.1016\/S0049-237X(08)71929-3"},{"issue":"2","key":"8_CR19","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/0304-3975(93)90030-W","volume":"112","author":"J Skurczy\u0144ski","year":"1993","unstructured":"Skurczy\u0144ski, J.: The borel hierarchy is infinite in the class of regular sets of trees. Theoret. Comput. Sci. 112(2), 413\u2013418 (1993)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR20","unstructured":"Wadge, W.: Reducibility and Determinateness in the Baire space. Ph.D. thesis, University of California, Berkeley (1983)"},{"issue":"2","key":"8_CR21","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0019-9958(79)90653-3","volume":"43","author":"K Wagner","year":"1979","unstructured":"Wagner, K.: On $$\\omega $$-regular sets. Inf. Control 43(2), 123\u2013177 (1979)","journal-title":"Inf. Control"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47709-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T20:21:56Z","timestamp":1748463716000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47709-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662477083","9783662477090"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47709-0_8","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":"24 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}