Julian C. Bradfield (1998):
The modal mu-calculus alternation hierarchy is strict.
Theoretical Computer Science 195(2),
pp. 133–153,
doi:10.1016/S0304-3975(97)00217-X.
Julian C Bradfield (1999):
Fixpoint alternation: Arithmetic, transition systems, and the binary tree.
RAIRO-Theoretical Informatics and Applications 33(4-5),
pp. 341–356,
doi:10.1051/ita:1999122.
Julian C. Bradfield & Colin Stirling (2007):
Modal mu-calculi.
Handbook of modal logic 3,
pp. 721–756,
doi:10.1016/S1570-2464(07)80015-2.
Thomas Colcombet, Denis Kuperberg, Christof Löding & Michael Vanden Boom (2013):
Deciding the weak definability of Büchi definable tree languages.
In: LIPIcs-Leibniz International Proceedings in Informatics 23.
Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik,
doi:10.4230/LIPIcs.CSL.2013.215.
Thomas Colcombet & Christof Löding (2008):
The non-deterministic Mostowski hierarchy and distance-parity automata.
In: International Colloquium on Automata, Languages, and Programming.
Springer,
pp. 398–409,
doi:10.1007/978-3-540-70583-3_33.
Anuj Dawar & Erich Grädel (2008):
The descriptive complexity of parity games.
In: International Workshop on Computer Science Logic.
Springer,
pp. 354–368,
doi:10.1007/978-3-540-87531-4_26.
E Allen Emerson & Charanjit S Jutla (1991):
Tree automata, mu-calculus and determinacy.
In: Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on.
IEEE,
pp. 368–377,
doi:10.1109/SFCS.1991.185392.
David Janin & Igor Walukiewicz (1995):
Automata for the modal μ-calculus and related results,
doi:10.1007/3-540-60246-1_160.
Dexter Kozen (1983):
Results on the propositional μ-calculus.
Theoretical Computer Science 27(3),
pp. 333–354,
doi:10.1016/0304-3975(82)90125-6.
Special Issue Ninth International Colloquium on Automata, Languages and Programming (ICALP) Aarhus, Summer 1982.
Dexter Kozen (1988):
A finite model theorem for the propositional μ-calculus.
Studia Logica 47(3),
pp. 233–241,
doi:10.1007/BF00370554.
Orna Kupferman, Moshe Y Vardi & Pierre Wolper (2000):
An automata-theoretic approach to branching-time model checking.
Journal of the ACM (JACM) 47(2),
pp. 312–360,
doi:10.1145/333979.333987.
Ralf Küsters & Thomas Wilke (2002):
Deciding the First Level of the μ-calculus Alternation Hierarchy 0209,
doi:10.1007/3-540-36206-1_22.
Karoliina Lehtinen (2015):
Disjunctive form and the modal μ alternation hierarchy.
FICS15, The 10th International Workshop on Fixed Points in Computer Science, EPTCS 191,
pp. 117,
doi:10.4204/EPTCS.191.11.
Karoliina Lehtinen & Sandra Quickert (2015):
Deciding the first levels of the modal μ alternation hierarchy by formula construction.
In: LIPIcs-Leibniz International Proceedings in Informatics 41.
Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik,
doi:10.4230/LIPIcs.CSL.2015.457.
Karoliina Lehtinen & Sandra Quickert (2017):
Σ^μ_2 is decidable for Π^μ_2.
In: Unveiling Dynamics and Complexity - 13th Conference on Computability in Europe, CiE 2017, Turku, Finland, June 12-16, 2017, Proceedings,
pp. 292–303,
doi:10.1007/978-3-319-58741-7_28.
Giacomo Lenzi (1996):
A hierarchy theorem for the μ-calculus.
In: Friedhelm Meyer & Burkhard Monien: Automata, Languages and Programming,
Lecture Notes in Computer Science 1099.
Springer Berlin Heidelberg,
pp. 87–97,
doi:10.1007/3-540-61440-0_119.
Donald A Martin (1975):
Borel determinacy.
Annals of Mathematics,
pp. 363–371,
doi:10.2307/1971035.
Radu Mateescu (2002):
Local Model-Checking of Modal Mu-Calculus on Acyclic Labeled Transition Systems.
In: Joost-Pieter Katoen & Perdita Stevens: Tools and Algorithms for the Construction and Analysis of Systems,
Lecture Notes in Computer Science 2280.
Springer Berlin Heidelberg,
pp. 281–295,
doi:10.1007/3-540-46002-0_20.
Damian Niwiński (1986):
On fixed-point clones,
pp. 464–473.
Springer Berlin Heidelberg,
Berlin, Heidelberg,
doi:10.1007/3-540-16761-7_96.
Martin Otto (1999):
Eliminating Recursion in the μ-Calculus,
pp. 531–540.
Springer Berlin Heidelberg,
Berlin, Heidelberg,
doi:10.1007/3-540-49116-3_50.
Michal Skrzypczak & Igor Walukiewicz (2016):
Deciding the Topological Complexity of Büchi Languages.
In: Yuval Rabani Ioannis Chatzigiannakis, Michael Mitzenmacher & Davide Sangiorgi: 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016),
Leibniz International Proceedings in Informatics (LIPIcs) 55.
Schloss Dagstuhl–Leibniz-Zentrum für Informatik,
Dagstuhl, Germany,
pp. 99:1–99:13,
doi:10.4230/LIPIcs.ICALP.2016.99.
Igor Walukiewicz (2002):
Monadic second-order logic on tree-like structures.
Theoretical Computer Science 275(1),
pp. 311–346,
doi:10.1016/S0304-3975(01)00185-2.
eptcs@eptcs.org