@incollection(bradfield-strict,
 author       = {J.C. Bradfield},
 year         = {1996},
 title        = {The modal mu-calculus alternation hierarchy is strict},
 editor       = {U. Montanari and V. Sassone},
 booktitle    = {CONCUR '96: Concurrency Theory},
 series       = {Lecture Notes in Computer Science},
 volume       = {1119},
 publisher    = {Springer Berlin Heidelberg},
 pages        = {233--246},
 doi          = {10.1007/3-540-61604-7\_58},
)
@article(bradfield2007modal,
 author       = {J.C. Bradfield and C. Stirling},
 year         = {2007},
 title        = {Modal mu-calculi},
 journal      = {Handbook of modal logic},
 volume       = {3},
 pages        = {721--756},
 doi          = {10.1016/S1570-2464(07)80015-2},
)
@article(Carton1999,
 author       = {O. Carton and R. Maceiras},
 year         = {1999},
 title        = {Computing the Rabin index of a parity automaton},
 journal      = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
 volume       = {33},
 number       = {6},
 pages        = {495--505},
 doi          = {10.1051/ita:1999129},
 url          = {http://eudml.org/doc/92617},
)
@incollection(non-det-rabin,
 author       = {T. Colcombet and C. L{\"o}ding},
 year         = {2008},
 title        = {The non-deterministic Mostowski hierarchy and distance-parity automata},
 booktitle    = {Automata, languages and programming},
 publisher    = {Springer},
 pages        = {398--409},
 doi          = {10.1007/978-3-540-70583-3\_33},
)
@article(DAgostinoHollenberg,
 author       = {G. D'Agostino and M. Hollenberg},
 year         = {2000},
 title        = {Logical Questions Concerning The mu-Calculus: Interpolation, Lyndon and Los-Tarski},
 journal      = {J. Symb. Log.},
 volume       = {65},
 number       = {1},
 pages        = {310--332},
 doi          = {10.2307/2586539},
)
@inproceedings(emerson1991tree,
 author       = {E. A. Emerson and C. S. Jutla},
 year         = {1991},
 title        = {Tree automata, mu-calculus and determinacy},
 booktitle    = {Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on},
 organization = {IEEE},
 pages        = {368--377},
 doi          = {10.1109/SFCS.1991.185392},
)
@inproceedings(game-aut-rabin,
 author       = {A. Facchini and F. Murlak and M. Skrzypczak},
 year         = {2013},
 title        = {Rabin-Mostowski index problem: a step beyond deterministic automata},
 booktitle    = {Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science},
 organization = {IEEE Computer Society},
 pages        = {499--508},
 doi          = {10.1109/LICS.2013.56},
)
@incollection(rabin-index,
 author       = {M. Huth and J. Kuo and N. Piterman},
 year         = {2012},
 title        = {The Rabin Index of Parity Games},
 editor       = {K. Eder and J. Lourenço and O. Shehory},
 booktitle    = {Hardware and Software: Verification and Testing},
 series       = {Lecture Notes in Computer Science},
 volume       = {7261},
 publisher    = {Springer Berlin Heidelberg},
 pages        = {259--260},
 doi          = {10.1007/978-3-642-34188-5\_25},
)
@inproceedings(janin1995automata,
 author       = {D. Janin and I. Walukiewicz},
 year         = {1995},
 title        = {Automata for the modal $\mu$-calculus and related results},
 booktitle    = {Proc. MFCS '95 LNCS 969},
 pages        = {552--562},
 doi          = {10.1007/3-540-60246-1\_160},
)
@inproceedings(jurdzinski2000small,
 author       = {M. Jurdzi{\'n}ski},
 year         = {2000},
 title        = {Small progress measures for solving parity games},
 booktitle    = {STACS 2000},
 organization = {Springer},
 pages        = {290--301},
 doi          = {10.1007/3-540-46541-3\_24},
)
@inproceedings(me-CSL-2015,
 author       = {M.K. Lehtinen and S. Quickert},
 year         = {2015},
 title        = {Deciding the first levels of the modal $\mu$ alternation hierarchy by formula construction},
 booktitle    = {(forthcoming) Proc. CSL '15},
)
@article(flowers,
 author       = {A. Niwiński and I. Walukiewicz},
 year         = {2005},
 title        = {Deciding Nondeterministic Hierarchy of Deterministic Tree Automata},
 journal      = {Electronic Notes in Theoretical Computer Science},
 volume       = {123},
 pages        = {195 -- 208},
 doi          = {10.1016/j.entcs.2004.05.015},
 note         = {Proceedings of the 11th Workshop on Logic, Language, Information and Computation (WoLLIC 2004)},
)
@incollection(det-rabin,
 author       = {D. Niwiński and I. Walukiewicz},
 year         = {1998},
 title        = {Relating hierarchies of word and tree automata},
 editor       = {M. Morvan and C. Meinel and D. Krob},
 booktitle    = {STACS 98},
 series       = {Lecture Notes in Computer Science},
 volume       = {1373},
 publisher    = {Springer Berlin Heidelberg},
 pages        = {320--331},
 doi          = {10.1007/BFb0028571},
)
@article(walukiewicz2000completeness,
 author       = {I. Walukiewicz},
 year         = {2000},
 title        = {Completeness of Kozen's axiomatisation of the propositional $\mu$-calculus},
 journal      = {Information and Computation},
 volume       = {157},
 number       = {1},
 pages        = {142--182},
 doi          = {10.1006/inco.1999.2836},
)