{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:53:43Z","timestamp":1725537223978},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642040269"},{"type":"electronic","value":"9783642040276"}],"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-04027-6_18","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T17:27:52Z","timestamp":1252949272000},"page":"225-239","source":"Crossref","is-referenced-by-count":1,"title":["Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata"],"prefix":"10.1007","author":[{"given":"Jacques","family":"Duparc","sequence":"first","affiliation":[]},{"given":"Alessandro","family":"Facchini","sequence":"additional","affiliation":[]},{"given":"Filip","family":"Murlak","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4\/5","key":"18_CR1","first-page":"329","volume":"33","author":"A. Arnold","year":"1999","unstructured":"Arnold, A.: The \u03bc-Calculus Alternation-Depth Hierarchy is Strict on Binary Trees. ITA\u00a033(4\/5), 329\u2013340 (1999)","journal-title":"ITA"},{"issue":"1\u20133","key":"18_CR2","first-page":"19","volume":"81","author":"A. Arnold","year":"2008","unstructured":"Arnold, A., Niwi\u0144ski, D.: Continuous Separation of Game Languages. Fundamenta Informaticae\u00a081(1\u20133), 19\u201328 (2008)","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"18_CR3","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0304-3975(97)00217-X","volume":"195","author":"J. Bradfield","year":"1998","unstructured":"Bradfield, J.: The Modal \u03bc-Calculus Alternation Hierarchy is Strict. Theor. Comput. Sci.\u00a0195(2), 133\u2013153 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BFb0028547","volume-title":"STACS 98","author":"J. Bradfield","year":"1998","unstructured":"Bradfield, J.: Simplifying the Modal \u03bc-Calculus Alternation Hierarchy. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol.\u00a01373, pp. 39\u201349. Springer, Heidelberg (1998)"},{"issue":"1","key":"18_CR5","doi-asserted-by":"publisher","first-page":"56","DOI":"10.2307\/2694911","volume":"66","author":"J. Duparc","year":"2001","unstructured":"Duparc, J.: Wadge Hierarchy and Veblen Hierarchy Part 1: Borel Sets of Finite Rank. J. Symb. Log.\u00a066(1), 56\u201386 (2001)","journal-title":"J. Symb. Log."},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1016\/S0304-3975(02)00567-4","volume":"290","author":"J. Duparc","year":"2003","unstructured":"Duparc, J.: A Hierarchy of Deterministic Context-Free \u03c9-Languages. Theoret. Comput. Sci.\u00a0290, 1253\u20131300 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR7","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.\u00a04639, pp. 261\u2013273. Springer, Heidelberg (2007)"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1017\/S0960129506005597","volume":"16","author":"O. Finkel","year":"2006","unstructured":"Finkel, O.: Borel Ranks and Wadge Degrees of \u03c9-Context Free Languages. Mathematical Structures in Computer Science\u00a016, 813\u2013840 (2006)","journal-title":"Mathematical Structures in Computer Science"},{"unstructured":"Hummel, S., Michalewski, H., Niwi\u0144ski, D.: On the Borel Inseparability of Game Tree Languages. In: Proc. of STACS 2009, pp. 565\u2013576 (2009)","key":"18_CR9"},{"doi-asserted-by":"crossref","unstructured":"Kupferman, O., Safra, S., Vardi, M.: Relating Word and Tree Automata. In: LICS 1996, pp. 322\u2013332 (1996)","key":"18_CR10","DOI":"10.1109\/LICS.1996.561360"},{"issue":"2","key":"18_CR11","first-page":"142","volume":"47","author":"O. Kupferman","year":"1994","unstructured":"Kupferman, O., Vardi, M., Wolper, P.: An Automata-Theoretic Approach to Branching-Time Model Checking. Journal of the ACM\u00a047(2), 142\u2013155 (1994)","journal-title":"Journal of the ACM"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/BF01691063","volume":"3","author":"L.H. Landweber","year":"1969","unstructured":"Landweber, L.H.: Decision Problems for \u03c9-Automata. Math. Systems Theory\u00a03, 376\u2013384 (1969)","journal-title":"Math. Systems Theory"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0304-3975(91)90283-8","volume":"83","author":"A.W. Mostowski","year":"1991","unstructured":"Mostowski, A.W.: Hierarchies of Weak Automata and Weak Monadic Formulas. Theoret. Comput. Sci.\u00a083, 323\u2013335 (1991)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR14","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.\u00a03634, pp. 428\u2013441. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Murlak, F.: The Wadge Hierarchy of Deterministic Tree Languages. Logical Methods in Comput. Sci.\u00a04(4), Paper 15","key":"18_CR15","DOI":"10.2168\/LMCS-4(4:15)2008"},{"doi-asserted-by":"crossref","unstructured":"Murlak, F.: Weak Index vs Borel Rank. In: Proc. STACS 2008, pp. 573\u2013584 (2008)","key":"18_CR16","DOI":"10.1016\/B978-008047172-3.50020-9"},{"key":"18_CR17","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.) ICALP 1986. LNCS, vol.\u00a0226, pp. 464\u2013473. Springer, Heidelberg (1986)"},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/BFb0028571","volume-title":"STACS 98","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.\u00a01373, pp. 320\u2013331. Springer, Heidelberg (1998)"},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0304-3975(02)00452-8","volume":"303","author":"D. Niwi\u0144ski","year":"2003","unstructured":"Niwi\u0144ski, D., Walukiewicz, I.: A Gap Property of Deterministic Tree Languages. Theor. Comput. Sci.\u00a0303, 215\u2013231 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR20","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.\u00a0123, 195\u2013208 (2005)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"18_CR21","first-page":"1","volume":"141","author":"M.O. Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Amer. Soc.\u00a0141, 1\u201335 (1969)","journal-title":"Trans. Amer. Soc."},{"key":"18_CR22","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1051\/ita:2003008","volume":"37","author":"V. Selivanov","year":"2003","unstructured":"Selivanov, V.: Wadge Degrees of \u03c9-Languages of Deterministic Turing Machines. Theoret. Informatics Appl.\u00a037, 67\u201383 (2003)","journal-title":"Theoret. Informatics Appl."},{"key":"18_CR23","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.\u00a0112, 413\u2013418 (1993)","journal-title":"Theoret. Comput. Sci."},{"unstructured":"Wadge, W.W.: Reducibility and Determinateness on the Baire Space. Ph.D. Thesis, Berkeley (1984)","key":"18_CR24"},{"key":"18_CR25","first-page":"473","volume":"13","author":"K. Wagner","year":"1977","unstructured":"Wagner, K.: Eine topolgische Charackterisierung einiger Klassen regul\u00e4rer Folgenmengen. J. Inf. Process. Cybern. EIK\u00a013, 473\u2013487 (1977)","journal-title":"J. Inf. Process. Cybern. EIK"},{"key":"18_CR26","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 \u03c9-Regular Sets. Inform. and Control\u00a043, 123\u2013177 (1979)","journal-title":"Inform. and Control"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04027-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,16]],"date-time":"2024-03-16T13:38:58Z","timestamp":1710596338000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04027-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642040269","9783642040276"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04027-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}