A. Blumensath and E. Grädel, Automatic structures, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332), pp.51-62, 2000.
DOI : 10.1109/LICS.2000.855755

C. Elgot and J. Mezei, On Relations Defined by Generalized Finite Automata, IBM Journal of Research and Development, vol.9, issue.1, pp.47-68, 1965.
DOI : 10.1147/rd.91.0047

C. Frougny and J. , Synchronized rational relations of finite and infinite words, Theoretical Computer Science, vol.108, issue.1, pp.45-82, 1993.
DOI : 10.1016/0304-3975(93)90230-Q

C. Morvan and C. , Stirling Rational graphs trace context-sensitive langages, MFCS, vol.26, 2001.
DOI : 10.1007/3-540-44683-4_48

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

D. Muller and P. , The theory of ends, pushdown automata, and second-order logic, Theoretical Computer Science, vol.37, pp.51-75, 1985.
DOI : 10.1016/0304-3975(85)90087-8