{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:45:17Z","timestamp":1743054317366,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319587400"},{"type":"electronic","value":"9783319587417"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-58741-7_28","type":"book-chapter","created":{"date-parts":[[2017,5,11]],"date-time":"2017-05-11T16:59:28Z","timestamp":1494521968000},"page":"292-303","source":"Crossref","is-referenced-by-count":1,"title":["$$\\varSigma ^{\\mu }_2$$ is decidable for $$\\varPi ^{\\mu }_2$$"],"prefix":"10.1007","author":[{"given":"Karoliina","family":"Lehtinen","sequence":"first","affiliation":[]},{"given":"Sandra","family":"Quickert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,12]]},"reference":[{"issue":"4\u20135","key":"28_CR1","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1051\/ita:1999121","volume":"33","author":"A Arnold","year":"1999","unstructured":"Arnold, A.: The $$\\mu $$ -calculus alternation-depth hierarchy is strict on binary trees. RAIRO - Theoretical Informatics and Applications - Informatique Th\u00e9orique et Applications 33(4\u20135), 329\u2013339 (1999)","journal-title":"RAIRO - Theoretical Informatics and Applications - Informatique Th\u00e9orique et Applications"},{"key":"28_CR2","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1016\/S1570-2464(07)80015-2","volume":"3","author":"JC Bradfield","year":"2007","unstructured":"Bradfield, J.C., Stirling, C.: Modal mu-calculi. Handbook of modal logic 3, 721\u2013756 (2007)","journal-title":"Modal mu-calculi. Handbook of modal logic"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/3-540-61604-7_58","volume-title":"CONCUR \u201996: Concurrency Theory","author":"JC Bradfield","year":"1996","unstructured":"Bradfield, J.C.: The modal mu-calculus alternation hierarchy is strict. In: Montanari, U., Sassone, V. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 233\u2013246. Springer, Heidelberg (1996). doi: 10.1007\/3-540-61604-7_58"},{"key":"28_CR4","unstructured":"Colcombet, T., Kuperberg, D., L\u00f6ding, C., Vanden Boom, M.: Deciding the weak definability of B\u00fcchi definable tree languages. In: LIPIcs-Leibniz International Proceedings in Informatics, vol. 23. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2013)"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-540-70583-3_33","volume-title":"Automata, Languages and Programming","author":"T Colcombet","year":"2008","unstructured":"Colcombet, T., L\u00f6ding, C.: The non-deterministic mostowski hierarchy and distance-parity automata. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5126, pp. 398\u2013409. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-70583-3_33"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus and determinacy. In: Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, FoCS 1991, pp. 368\u2013377. IEEE Computer Society Press (1991)","DOI":"10.1109\/SFCS.1991.185392"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Facchini, A., Murlak, F., Skrzypczak, M.: Rabin-mostowski index problem: a step beyond deterministic automata. In: Proceedings of the 2013 28th Annual ACM\/IEEE Symposium on Logic in Computer Science, pp. 499\u2013508. IEEE Computer Society (2013)","DOI":"10.1109\/LICS.2013.56"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/3-540-60246-1_160","volume-title":"Mathematical Foundations of Computer Science 1995","author":"D Janin","year":"1995","unstructured":"Janin, D., Walukiewicz, I.: Automata for the modal $$\\mu $$ -calculus and related results. In: Wiedermann, J., H\u00e1jek, P. (eds.) MFCS 1995. LNCS, vol. 969, pp. 552\u2013562. Springer, Heidelberg (1995). doi: 10.1007\/3-540-60246-1_160"},{"issue":"2","key":"28_CR9","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1145\/333979.333987","volume":"47","author":"O Kupferman","year":"2000","unstructured":"Kupferman, O., Vardi, M.Y., Wolper, P.: An automata-theoretic approach to branching-time model checking. J. ACM (JACM) 47(2), 312\u2013360 (2000)","journal-title":"J. ACM (JACM)"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/3-540-36206-1_22","volume-title":"FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science","author":"R K\u00fcsters","year":"2002","unstructured":"K\u00fcsters, R., Wilke, T.: Deciding the first level of the $$\\mu $$ -calculus alternation hierarchy. In: Agrawal, M., Seth, A. (eds.) FSTTCS 2002. LNCS, vol. 2556, pp. 241\u2013252. Springer, Heidelberg (2002). doi: 10.1007\/3-540-36206-1_22"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Lehtinen, K.: Disjunctive form and the modal $$\\mu $$ alternation hierarchy. In: FICS 2015 The 10th International Workshop on Fixed Points in Computer Science, EPTCS 191, p. 117 (2015)","DOI":"10.4204\/EPTCS.191.11"},{"key":"28_CR12","unstructured":"Lehtinen, K., Quickert, S.: Deciding the first levels of the modal mu alternation hierarchy by formula construction. In: LIPIcs-Leibniz International Proceedings in Informatics, vol. 1. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2015)"},{"key":"28_CR13","unstructured":"Lehtinen, M.K., Quickert, S.: $$\\Sigma ^{\\mu }_2$$ is decidable for $$\\Pi ^{\\mu }_2$$ (extended version). Technical report. arXiv:1703.03239"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/3-540-61440-0_119","volume-title":"Automata, Languages and Programming","author":"G Lenzi","year":"1996","unstructured":"Lenzi, G.: A hierarchy theorem for the $$\\mu $$ -calculus. In: Meyer, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 87\u201397. Springer, Heidelberg (1996). doi: 10.1007\/3-540-61440-0_119"},{"key":"28_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/3-540-46002-0_20","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R Mateescu","year":"2002","unstructured":"Mateescu, R.: Local model-checking of modal mu-calculus on acyclic labeled transition systems. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 281\u2013295. Springer, Heidelberg (2002). doi: 10.1007\/3-540-46002-0_20"},{"key":"28_CR16","unstructured":"Mostowski, A.W.: Games with forbidden sequences and finite machines. Technical report 78, Instytut Matematyki, Uniwersytet Gda\u0144ski, Poland (1991)"},{"key":"28_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. 226, pp. 464\u2013473. Springer, Heidelberg (1986). doi: 10.1007\/3-540-16761-7_96"},{"key":"28_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: Morvan, M., Meinel, C., Krob, D. (eds.) STACS 1998. LNCS, vol. 1373, pp. 320\u2013331. Springer, Heidelberg (1998). doi: 10.1007\/BFb0028571"},{"issue":"1","key":"28_CR19","doi-asserted-by":"crossref","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. 303(1), 215\u2013231 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"28_CR20","doi-asserted-by":"crossref","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. Electron. Notes Theor. Comput. Sci. 123, 195\u2013208 (2005)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"28_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/3-540-49116-3_50","volume-title":"STACS 99","author":"M Otto","year":"1999","unstructured":"Otto, M.: Eliminating recursion in the $$\\mu $$ -calculus. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 531\u2013540. Springer, Heidelberg (1999). doi: 10.1007\/3-540-49116-3_50"},{"key":"28_CR22","doi-asserted-by":"crossref","unstructured":"Rabin, M.O.: Weakly definable relations and special automata. In: Bar-Hillel, Y. (ed.) Mathematical Logic and Foundations of Set Theory, pp. 1\u201323 (1970)","DOI":"10.1016\/S0049-237X(08)71929-3"},{"key":"28_CR23","unstructured":"Skrzypczak, M., Walukiewicz, I.: Deciding the topological complexity of b\u00fcchi languages. In: Rabani, Y., Chatzigiannakis, I., Mitzenmacher, M., Sangiorgi, D. (eds.) 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), vol. 55, Leibniz International Proceedings in Informatics (LIPIcs), pp. 99:1\u201399:13. Dagstuhl, Germany (2016). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik"},{"key":"28_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/3-540-45022-X_56","volume-title":"Automata, Languages and Programming","author":"TF Urba\u0144ski","year":"2000","unstructured":"Urba\u0144ski, T.F.: On deciding if deterministic rabin language is in b\u00fcchi class. In: Montanari, U., Rolim, J.D.P., Welzl, E. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 663\u2013674. Springer, Heidelberg (2000). doi: 10.1007\/3-540-45022-X_56"},{"issue":"1\u20132","key":"28_CR25","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1006\/inco.1999.2836","volume":"157","author":"I Walukiewicz","year":"2000","unstructured":"Walukiewicz, I.: Completeness of Kozen\u2019s axiomatisation of the propositional $$\\mu $$ -calculus. Inf. Comput. 157(1\u20132), 142\u2013182 (2000)","journal-title":"Inf. Comput."},{"issue":"2","key":"28_CR26","doi-asserted-by":"crossref","first-page":"359","DOI":"10.36045\/bbms\/1102714178","volume":"8","author":"T Wilke","year":"2001","unstructured":"Wilke, T.: Alternating tree automata, parity games, and modal m-calculus. Bull. Belg. Math. Soc. Simon Stevin 8(2), 359 (2001)","journal-title":"Bull. Belg. Math. Soc. Simon Stevin"}],"container-title":["Lecture Notes in Computer Science","Unveiling Dynamics and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-58741-7_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,7]],"date-time":"2020-10-07T09:26:42Z","timestamp":1602062802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-58741-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319587400","9783319587417"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-58741-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}