Abstract
In this paper we present the genetic message translation in terms of automata, transformation semigroups, restricted direct product and cascade product. We give a description of the alphabets and words involved in the processes of transcription and translation. We define a Mealy automata for the translation process, providing its detailed coverings by simpler machines. This leads to an interesting structural representation of the proteins.