An addressable machine as the interpretation of a free group

In this paper we propose a combinatorial approach to the study of addressable machines. As a consequence of such an approach the set of instructions defining our machine is the union of the set of the generators of a free group and of the set of their inverses together with the identity. Moreover the elements of the free group are the programs of the machine and are obtained as the representatives of the equivalence classes containing their execution sequences.