M. Albenque and P. Nadeau, Growth function for a class of monoids, Proceedings of FPSAC 2009, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01185420

A. Arnold, M. Kanta, and D. Krob, Recognizable subsets of the two letter plactic monoid, Information Processing Letters, vol.64, issue.2, pp.53-59, 1997.
DOI : 10.1016/S0020-0190(97)00157-9

URL : https://hal.archives-ouvertes.fr/hal-00018541

J. Berstel, Transductions and Context-Free Languages, 1979.
DOI : 10.1007/978-3-663-09367-1

URL : https://hal.archives-ouvertes.fr/hal-00619779

S. Kellogg, G. S. Booth, and . Lueker, Linear algorithms to recognize interval graphs and test for the consecutive ones property, STOC, pp.255-265, 1975.

V. Diekert, Combinatorics on Traces, Lecture Notes in Computer Science, vol.454, 1990.
DOI : 10.1007/3-540-53031-2

S. Eilenberg and . Automata, Languages and Machines, volume A, 1974.

G. Lallement, Semigroups and Combinatorial Applications, 1979.

M. Lothaire, Algebraic Combinatorics on Words, 2002.
DOI : 10.1017/CBO9781107326019

URL : https://hal.archives-ouvertes.fr/hal-00620608

A. Mazurkiewicz and . Trace, Petri Nets, Applications and Relationship to other Models of Concurrency, Lecture Notes in Computer Science, vol.255, pp.279-324, 1987.

. Jr and . Mcknight, Kleene quotient theorems, Pacific Journal of Mathematics, vol.14, pp.1343-1352, 1964.