1. C. Àlvarez and J. Gabarró. The parallel complexity of two problems on concurrency. Information Processing Letters, 38:61–70, 1991.
2. IJ. J. Aalbersberg and H. J. Hoogeboom. Characterizations of the decidability of some problems for regular trace languages. Mathematical Systems Theory, 22:1–19, 1989.
3. J. L. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I. Number 11 in EATCS Monographs on Theoretical Computer Science. Springer, Berlin-Heidelberg-New York, 1988.
4. D.M. Barrington, N. Immerman, and H. Straubing. On uniformity within NC1. J. of Comp. and Syst. Sciences, 41:274–306, 1990.
5. M. Clerbout, D. Gonzalez, M. Latteux, E. Ochmanski, Y. Roos, and P.A. Wacrenier. Recognizable morphisms on semi commutations. Tech. Rep. LIFL I.T.-238, Université des Sciences et Technologies de Lille (France), 1992.