Rajeev Alur & P. Madhusudan (2004):
Visibly pushdown languages.
In: László Babai: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004.
ACM,
pp. 202–211,
doi:10.1145/1007352.1007390.
André Arnold (1999):
The μ-calculus alternation-depth hierarchy is strict on binary trees.
ITA 33(4/5),
pp. 329–340,
doi:10.1051/ita:1999121.
André Arnold & Maurice Nivat (1980):
The metric space of infinite trees. Algebraic and topological properties.
Fundam. Inform. 3(4),
pp. 445–476.
Julian C. Bradfield (1996):
The Modal mu-calculus Alternation Hierarchy is Strict.
In: Ugo Montanari & Vladimiro Sassone: CONCUR '96, Concurrency Theory, 7th International Conference, Pisa, Italy, August 26-29, 1996, Proceedings,
Lecture Notes in Computer Science 1119.
Springer,
pp. 233–246,
doi:10.1007/3-540-61604-7_58.
Florian Bruse (2014):
Alternating Parity Krivine Automata.
In: Erzsébet Csuhaj-Varjú, Martin Dietzfelbinger & Zoltán Ésik: Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part I,
Lecture Notes in Computer Science 8634.
Springer,
pp. 111–122,
doi:10.1007/978-3-662-44522-8_10.
E. Allen Emerson & Chin-Laung Lei (1986):
Efficient Model Checking in Fragments of the Propositional Mu-Calculus (Extended Abstract).
In: Proceedings of the Symposium on Logic in Computer Science (LICS '86), Cambridge, Massachusetts, USA, June 16-18, 1986.
IEEE Computer Society,
pp. 267–278.
Julian Gutierrez, Felix Klaedtke & Martin Lange (2014):
The μ-calculus alternation hierarchy collapses over structures with restricted connectivity.
Theor. Comput. Sci. 560,
pp. 292–306,
doi:10.1016/j.tcs.2014.03.027.
Roope Kaivola (1995):
Axiomatising Linear Time Mu-calculus.
In: Insup Lee & Scott A. Smolka: CONCUR '95: Concurrency Theory, 6th International Conference, Philadelphia, PA, USA, August 21-24, 1995, Proceedings,
Lecture Notes in Computer Science 962.
Springer,
pp. 423–437,
doi:10.1007/3-540-60218-6_32.
Jean-Louis Krivine (2007):
A call-by-name lambda-calculus machine.
Higher-Order and Symbolic Computation 20(3),
pp. 199–207,
doi:10.1007/s10990-007-9018-9.
Martin Lange (2006):
The alternation hierarchy in fixpoint logic with chop is strict too.
Inf. Comput. 204(9),
pp. 1346–1367,
doi:10.1016/j.ic.2006.05.001.
Étienne Lozes (2015):
A Type-Directed Negation Elimination.
In: Ralph Matthes & Matteo Mio: Proceedings Tenth International Workshop on Fixed Points in Computer Science, FICS 2015, Berlin, Germany, September 11-12, 2015.,
EPTCS 191,
pp. 132–142,
doi:10.4204/EPTCS.191.12.
Damian Niwinski (1997):
Fixed Point Characterization of Infinite Behavior of Finite-State Systems.
Theor. Comput. Sci. 189(1-2),
pp. 1–69,
doi:10.1016/S0304-3975(97)00039-X.
Michael O. Rabin (1970):
Weakly Definable Relations and Special Automata.
In: Yehoshua Bar-Hillel: Mathematical Logic and Foundations of Set Theory - Proceedings of an International Colloquium Held Under the Auspices of The Israel Academy of Sciences and Humanities,
Studies in Logic and the Foundations of Mathematics 59.
Elsevier,
pp. 1 – 23,
doi:10.1016/S0049-237X(08)71929-3.
Mahesh Viswanathan & Ramesh Viswanathan (2004):
A Higher Order Modal Fixed Point Logic.
In: Philippa Gardner & Nobuko Yoshida: CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31 - September 3, 2004, Proceedings,
Lecture Notes in Computer Science 3170.
Springer,
pp. 512–528,
doi:10.1007/978-3-540-28644-8_33.