1. A. Browne, E. M. Clarke, S. Jha, D. E. Long, and W. Marrero. An improved algorithm for the evaluation of fixpoint expressions. Theoretical Computer Science, 178(1–2):237–255, May 1997.
2. E. A. Emerson and C. S. Jutla. Tree automata, mu-calculus and determinacy (Extended abstract). In Proceedings of 32nd Annual Symposium on Foundations of Computer Science, pages 368–377. IEEE Computer Society Press, 1991.
3. Lect Notes Comput Sci;E. A. Emerson,1993
4. E. Allen Emerson and Charanjit S. Jutla. The complexity of tree automata and logics of programs. In Proceedings of 29th Annual Symposium on Foundations of Computer Science, pages 328–337, White Plains, New York, 24–26 October 1988. IEEE Computer Society Press.
5. E. Allen Emerson and Chin-Laung Lei. Efficient model checking in fragments of the propositional mu-calculus (Extended abstract). In Proceedings, Symposium on Logic in Computer Science, pages 267–278, Cambridge, Massachusetts, 16–18 June 1986. IEEE.