J. Berstel, D. Perrin, and C. Reutenauer, Codes and Automata, 2009.
DOI : 10.1017/CBO9781139195768

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

S. Eilenberg and . Automata, With two chapters ( " Depth decomposition theorem " and " Complexity of semigroups and morphisms, Pure and Applied Mathematics, vol.59, 1976.

V. Froidure and J. Pin, Algorithms for computing finite semigroups, Foundations of computational mathematics, pp.112-126, 1997.
DOI : 10.1007/978-3-642-60539-0_9

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

G. Lallement, Semigroups and combinatorial applications, 1979.

M. Schützenberger, On the synchronizing properties of certain prefix codes, Information and Control, vol.7, issue.1, pp.23-36, 1964.
DOI : 10.1016/S0019-9958(64)90232-3

M. Schützenberger, Sur les mono??des finis dont les groupes sont commutatifs, Revue fran??aise d'automatique informatique recherche op??rationnelle. Informatique th??orique, vol.8, issue.R1, pp.55-61, 1974.
DOI : 10.1051/ita/197408R100551

H. Wielandt, Finite permutation groups [53], 1964.
DOI : 10.1515/9783110863383.119