1. Analysis of algorithms for the recognition of rational and context-free trace languages;Avellone;RAIRO Theoretical Informatics and Applications,1998
2. Local languages and the Berry–Sethi algorithm;Berstel;Theoretical Computer Science,1996
3. Counting techniques for inclusion, equivalence and membership problems;Bertoni,1995
4. A. Bertoni, G. Mauri, N. Sabadini, Unambiguous regular trace languages, in: Proceedings of the Colloquium on Algebra, Combinatorics and Logic in Computer Science, Colloquia Mathematica Society Journal, Bolyai, vol. 42, North-Holland, Amsterdam, 1985, pp. 113–123.
5. Membership problems for regular and context-free trace languages;Bertoni;Information and Computation,1989