In this paper a comparison is
made for various definitions of radicals and semisimpliciq on the class of Rees matrix
semigroups. Preliminary lo this, results are obtained on various types of right
congmences. This is equivalent to characterizing various types of automata having a
Rees matrix semigroup as an input semigroup.