1. I.J. Aalbersberg, H.J. Hoogeboom, Characterizations of the decidability of some problems for regular trace languages, Math. Systems Theory 22 (1989) 1–19.
2. J. Berstel, D. Perrin, Theory of Codes, Academic Press, New York, 1985.
3. V. Bruyère, C. De Felice, G. Guaiana, Coding with Traces, Proc. STACS'94, Lecture Notes Comput. Sci. 775 (1994) 353–364.
4. V. Bruyère, C. De Felice, G. Guaiana, Decidability for coding between trace monoids, submitted (1994).
5. P. Cartier, D. Foata, Problèmes combinatoires de commutation et réarrangements, Lecture Notes irr Mathematics 85, Springer, Berlin Heidelberg New-York (1969).