1. Lecture Notes in Computer Science;C. Choffrut,1984
2. V.R. Dare and R. Siromoney, Subword topology, TR MATH 12/1985, Department of Mathematics, Madras Christian College, Madras.
3. M. Harrison, Introduction to Formal Languages Theory, (Addison-Wesley, Reading, Mass, 1978).
4. A. Nakamura and H. Ono, Pictures of functions and their acceptability by automata, Theoret. Comput. Sci. 23 (1983) 37–48.
5. M. Nivat, Infinite words, infinite trees and infinite computations, Mathematical Centre Tracts 109 (1979) 1–52.