The aim of this paper is to show that a semi-commutation function can be ex
pressed as the compound of a sequential transformation, a partial commutati
on function, and the reverse transformation. Moreover, we give a necessary
and sufficient condition for the image of a regular language to be computed
by the compound of two sequential functions and a partial commutation func
tion.