[3] H. Comon, M. Dauchet, R. Gilleron, F. J. D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available at: http://www.grappa.univ-lille3.fr/tata, 1997. release October, 1rst 2002. [4] J. Doner. Tree acceptors and some of their applications. Journal of Computer and System Sciences, 4:406 451, 1970. [5] Y. Gurevich and L. Harrington. Trees, automata, and games. In Proceedings of the fourteenth annual ACM Symposium on Theory of Computing, San Francisco, California, May 5 7, 1982, pages 60 65, New York, NY, USA, 1982. ACM Press. [6] Y. S. Gurevich. Monadic second-order theories. In J. Barwise and S. Feferman, editors, Model-theoretic Logics. Springer Verlag, 1985. [7] D. Harel, D. Kozen, and J. Tiuryn. Dynamic Logic. MIT Press, 2000. [8] D. Perrin and J.-E. Pin. In nite words. Available http://www.liafa.jussieu.fr/~jep/Resumes/InfiniteWords.html, to appear. at [9] M. O. Rabin. Decidability of second-order theories and automata on in nite trees. Trans. of Amer. Math. Soc., 141:1 35, 1969. [10] M. O. Rabin. Decidable theories. In J. Barwise, editor, Handbook of Mathematical Logic. North-Holland, Amsterdam, 1977. [11] J. Rogers. A Descriptive Approach to Language Theoretic Complexity. CSLI Publications, 1998. [12] C. Stirling. Modal and Temporal Properties of Processes. Springer, 2001. [13] J.
/lp/association-for-computing-machinery/review-of-automatic-sequences-theory-applications-generalizations-by-w0Jy1ZA5lj