1. I. J. J. Aalbersberg and H. J. Hoogeboom. Characterizations of the decidability of some problems for regular trace languages. Mathematical Systems Theory, 22:1–19, 1989.
2. J. Berstel and D. Perrin. Theory of Codes. Pure and Applied Mathematics; 117. Academic Press, Orlando, Florida, 1985.
3. A. Bertoni, G. Mauri, and N. Sabadini. Equivalence and membership problems for regular trace languages. In Proceedings of the 9th International Colloquium on Automata, Languages and Programming (ICALP'82), number 140 in Lecture Notes in Computer Science, pages 61–71, Berlin-Heidelberg-New York, 1982. Springer.
4. V. Bruyère and C. De Felice. Trace codings. In E. Mayr and C. Puech, editors, Proceedings of the 12th Annual Symposium on Theoretical Aspects of Computer Science (STACS'95), 1995, number 900 in Lecture Notes in Computer Science, pages 373–384, Berlin-Heidelberg-New York, 1995. Springer.
5. V. Bruyère and C. De Felice. Any lifting of a trace coding is a word coding. Submitted for publication, 1996.