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