{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T23:31:36Z","timestamp":1649028696020},"reference-count":14,"publisher":"Open Publishing Association","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. Proc. Theor. Comput. Sci.","EPTCS"],"DOI":"10.4204\/eptcs.191.11","type":"journal-article","created":{"date-parts":[[2015,9,9]],"date-time":"2015-09-09T13:14:56Z","timestamp":1441804496000},"page":"117-131","source":"Crossref","is-referenced-by-count":3,"title":["Disjunctive form and the modal \u03bc alternation hierarchy"],"prefix":"10.4204","volume":"191","author":[{"given":"Karoliina","family":"Lehtinen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"2720","published-online":{"date-parts":[[2015,9,9]]},"reference":[{"key":"bradfield-strict","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/3-540-61604-7_58","article-title":"The modal mu-calculus alternation hierarchy is strict","volume-title":"CONCUR '96: Concurrency Theory","volume":"1119","author":"Bradfield","year":"1996"},{"key":"bradfield2007modal","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1016\/S1570-2464(07)80015-2","article-title":"Modal mu-calculi","volume":"3","author":"Bradfield","year":"2007","journal-title":"Handbook of modal logic"},{"issue":"6","key":"Carton1999","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1051\/ita:1999129","article-title":"Computing the Rabin index of a parity automaton","volume":"33","author":"Carton","year":"1999","journal-title":"RAIRO - Theoretical Informatics and Applications - Informatique Th\u00e9orique et Applications"},{"key":"non-det-rabin","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-540-70583-3_33","article-title":"The non-deterministic Mostowski hierarchy and distance-parity automata","volume-title":"Automata, languages and programming","author":"Colcombet","year":"2008"},{"issue":"1","key":"DAgostinoHollenberg","doi-asserted-by":"publisher","first-page":"310","DOI":"10.2307\/2586539","article-title":"Logical Questions Concerning The mu-Calculus: Interpolation, Lyndon and Los-Tarski","volume":"65","author":"D'Agostino","year":"2000","journal-title":"J. Symb. Log."},{"key":"emerson1991tree","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1109\/SFCS.1991.185392","article-title":"Tree automata, mu-calculus and determinacy","volume-title":"Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on","author":"Emerson","year":"1991"},{"key":"game-aut-rabin","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1109\/LICS.2013.56","article-title":"Rabin-Mostowski index problem: a step beyond deterministic automata","volume-title":"Proceedings of the 2013 28th Annual ACM\/IEEE Symposium on Logic in Computer Science","author":"Facchini","year":"2013"},{"key":"rabin-index","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-642-34188-5_25","article-title":"The Rabin Index of Parity Games","volume-title":"Hardware and Software: Verification and Testing","volume":"7261","author":"Huth","year":"2012"},{"key":"janin1995automata","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/3-540-60246-1_160","article-title":"Automata for the modal \u03bc-calculus and related results","volume-title":"Proc. MFCS '95 LNCS 969","author":"Janin","year":"1995"},{"key":"jurdzinski2000small","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/3-540-46541-3_24","article-title":"Small progress measures for solving parity games","volume-title":"STACS 2000","author":"Jurdzi\u0144ski","year":"2000"},{"key":"me-CSL-2015","article-title":"Deciding the first levels of the modal \u03bc alternation hierarchy by formula construction","volume-title":"(forthcoming) Proc. CSL '15","author":"Lehtinen","year":"2015"},{"key":"flowers","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.entcs.2004.05.015","article-title":"Deciding Nondeterministic Hierarchy of Deterministic Tree Automata","volume":"123","author":"Niwi\u0144ski","year":"2005","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"det-rabin","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/BFb0028571","article-title":"Relating hierarchies of word and tree automata","volume-title":"STACS 98","volume":"1373","author":"Niwi\u0144ski","year":"1998"},{"issue":"1","key":"walukiewicz2000completeness","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1006\/inco.1999.2836","article-title":"Completeness of Kozen's axiomatisation of the propositional \u03bc-calculus","volume":"157","author":"Walukiewicz","year":"2000","journal-title":"Information and Computation"}],"container-title":["Electronic Proceedings in Theoretical Computer Science"],"original-title":[],"language":"en","deposited":{"date-parts":[[2015,9,18]],"date-time":"2015-09-18T10:25:23Z","timestamp":1442571923000},"score":1,"resource":{"primary":{"URL":"http:\/\/arxiv.org\/abs\/1509.03019"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,9]]},"references-count":14,"URL":"https:\/\/doi.org\/10.4204\/eptcs.191.11","relation":{},"ISSN":["2075-2180"],"issn-type":[{"value":"2075-2180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,9]]}}}