1. Logical definability of fixed points;Arnold;Theoret. Comput. Sci.,1988
2. Fixed point characterisation of Büchi automata on infinite trees;Arnold;J. Inform. Process. Cybernet.,1990
3. Fixed points of Büchi automata;Dam,1992
4. Efficient model-checking in fragments of the propositional mu-calculus;Emerson,1986
5. SnS can be modally characterised;Hüttel;Theoret. Comput. Sci.,1990