1. M. Ajtai, R. Fagin, and L.J. Stockmeyer. The closure of monadic NP. Research Report RJ 10092, IBM, Dec 1997.
2. M. Ajtai, R. Fagin, and L.J. Stockmeyer. The closure of monadic NP. In The Thirtieth Annual ACM Symposium on Theory of Computing, pages 309–318. SIGACT, 1998.
3. J.A. Brzozowski and R. Knast. The dot-depth hierarchy of star-free languages is infinite. Journal of Computer and System Sciences, 5:1–16, 1971.
4. H.D. Ebbinghaus and J. Flum. Finite Model Theory. Springer-Verlag, New York, 1995.
5. R. Fagin. Generalized first-order spectra and polynomial-time recognizable sets. In R.M. Karp, editor, Complexity of Computation, volume 7 of SIAM-Proceedings, pages 43–73. AMS, 1974.