J. Berstel, Transductions and context-free languages. Teubner, 1979.
URL : https://hal.archives-ouvertes.fr/hal-00619779

F. Moller, O. Burkart, D. Caucal, and B. Steffen, Handbook of Process Algebra, chapter Verification on infinite structures, pp.545-623, 2001.

D. Caucal, On transition graphs having a decidable monadic theory, Icalp 96, pp.194-205, 1996.

B. Courcelle, Handbook of Theoretical Computer Science, chapter Graph rewriting: an algebraic and logic approach, 1990.

S. Ginsburg and G. Rose, Preservation of languages by transducers, Information and Control, vol.9, issue.2, pp.153-176, 1966.
DOI : 10.1016/S0019-9958(66)90211-7

T. Knapik and E. Payet, Synchronization product of linear bounded machines, FCT, pp.362-373, 1999.

A. Mateescu and A. Salomaa, Handbook of Formal Languages, volume 1, chapter Aspects of classical language theory, pp.175-252, 1997.

C. Morvan, On Rational Graphs, Fossacs 00, pp.252-266, 2000.
DOI : 10.1007/3-540-46432-8_17
URL : https://hal.archives-ouvertes.fr/hal-00620062

D. Muller and P. Schupp, 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

M. Penttonen, One-sided and two-sided context in formal grammars, Information and Control, vol.25, issue.4, pp.371-392, 1974.
DOI : 10.1016/S0019-9958(74)91049-3