1. IJ.J. Aalbersberg and H.J. Hogeboom, Decision problems for regular trace languages, Proc. 14th I.C.A.L.P., Lecture Notes in Computer Science n.267 (Springer-Verlag, 1987), 251–259.
2. IJ.J. Aalbersberg and G. Rozenberg, Theory of traces, Tech. Rep. 86-16, Dep. of Comput. Sci., University of Leiden (The Netherlands), September 1986.
3. IJ.J. Aalbersberg and E. Welzl, Trace languages defined by regular string languages, R.A.I.R.O. Inform. Théor. et Applic. 20 (1986), 103–119.
4. A.V. Aho, J.E. Hopcroft and J.D. Ullman, The design and analysis of computer algorithms (Addison-Wesley, Reading, 1974).
5. F. Bender, Asymptotic methods in enumeration, S.I.A.M. Review 16 (1974), 485–515.