\(\mathcal{J}_{2}\) radical in automata nearrings (Q2929637)

Automata over a group alphabet can be seen as mappings from a group into itself. Addition and concatenation of such automata then coincide with addition and composition, respectively, of these maps. Automata can thus be studied in the context of near-rings. They do give rather complicated near-rings and the authors use a well-established algebraic technique to facilitate their study: use the radical to round up badly behaving elements and describe the (well-behaving) semisimple image.NEWLINENEWLINEIn particular, an upper bound and a lower bound are found for the \(J_{2}\)-radical of such a near-ring using amnesic and delaying maps respectively. For certain groups the radical is described explicitly and in such cases the semisimple image is completely described.