1. R. Cori, Y. Métivier, and W. Zielonka. Asynchronous mappings and asynchronous cellular automata. Tech. rep. 89–97, LABRI, Univ. Bordeaux, 1989.
2. V. Diekert. Combinatorics on Traces. Number 454 in Lecture Notes in Computer Science. Springer, Berlin-Heidelberg-New York, 1990.
3. S. Eilenberg. Automata, Languages and Machines, volume I. Academic Press, New York and London, 1974.
4. P. Gastin. Recognizable and rational trace languages of finite and infinite traces. In Choffrut C. et al., editors, Proceedings of the 8th Annual Symposium on Theoretical Aspects of Computer Science (STACS'91), Hamburg 1991, number 480 in Lecture Notes in Computer Science, pages 89–104. Springer, Berlin-Heidelberg-New York, 1991.
5. P. Gastin and A. Petit. Büchi (asynchronous) automata for infinite traces. Tech. rep., LRI, Université Paris-Sud, 1991.