J. Almeida, Finite semigroups and universal algebra, Series in Algebra 3, World Scientific, 1994.

J. Berstel, Transductions and context-free languages, 1979.
DOI : 10.1007/978-3-663-09367-1
URL : https://hal.archives-ouvertes.fr/hal-00619779

J. Berstel, L. Boasson, O. Carton, B. Petazzoni, and J. Pin, Operations Preserving Recognizable Languages, FCT'2003, pp.343-354, 2003.
DOI : 10.1007/978-3-540-45077-1_32
URL : https://hal.archives-ouvertes.fr/hal-00112814

O. Carton and W. Thomas, The Monadic Theory of Morphic Infinite Words and Generalizations, Lecture Notes in Computer Science, vol.1893, pp.275-284, 2000.
DOI : 10.1007/3-540-44612-5_23

O. Carton and W. Thomas, The Monadic Theory of Morphic Infinite Words and Generalizations, Information and Computation, vol.176, issue.1, pp.51-76, 2002.
DOI : 10.1006/inco.2001.3139

J. H. Conway, Regular Algebra and Finite Machines, 1971.

S. Ginsburg, The Mathematical Theory of Context-free Languages, 1966.

S. R. Kosaraju, Finite state automata with markers, Proc. Fourth Annual Princeton Conference on Information Sciences and Systems, p.380, 1970.

S. R. Kosaraju, Regularity preserving functions, ACM SIGACT News, vol.6, issue.2, pp.16-17, 1974.
DOI : 10.1145/1008304.1008306

S. R. Kosaraju, Context-free preserving functions, Mathematical Systems Theory, vol.9, issue.2, pp.193-197, 1975.
DOI : 10.1007/BF01704019

D. Kozen, On regularity-preserving functions Erratum: On Regularity-Preserving Functions, Bull. Europ. Assoc. Theor. Comput. Sc. Bull. Europ. Assoc. Theor. Comput. Sc, vol.58, pp.131-138, 1996.

A. B. Matos, Regularity-preserving letter selections

J. Pin and J. Sakarovitch, Some operations and transductions that preserve rationality, 6th GI Conference, pp.617-628, 1983.
DOI : 10.1007/BFb0036488
URL : https://hal.archives-ouvertes.fr/hal-00340780

J. Pin and J. Sakarovitch, Une application de la representation matricielle des transductions, Theoretical Computer Science, vol.35, pp.271-293, 1985.
DOI : 10.1016/0304-3975(85)90019-2

J. I. Seiferas, A note on prefixes of regular languages, ACM SIGACT News, vol.6, issue.1, pp.25-29, 1974.
DOI : 10.1145/1811129.1811132

J. I. Seiferas and R. Mcnaughton, Regularity-preserving relations, Theoretical Computer Science, vol.2, issue.2, pp.147-154, 1976.
DOI : 10.1016/0304-3975(76)90030-X

D. Siefkes, Decidable extensions of monadic second order successor arithmetic , in: Automatentheorie und formale Sprachen, pp.441-472, 1970.

R. E. Stearns and J. Hartmanis, Regularity preserving modifications of regular expressions, Information and Control, vol.6, issue.1, pp.55-69, 1963.
DOI : 10.1016/S0019-9958(63)90110-4

G. Zhang, Automata, Boolean matrices, and ultimate periodicity, Information and Computation, pp.138-154, 1999.
DOI : 10.1006/inco.1998.2787
URL : http://doi.org/10.1006/inco.1998.2787

G. Zhang, Periodic functions for finite semigroups, preprint