J₂ radical in automata nearrings

From MaRDI portal
Publication:2929637



Abstract: Looking at the automata defined over a group alphabet as a nearring, we see that they are a highly complicated structure. As with ring theory, one method to deal with complexity is to look at semisimplicity modulo radical structures. We find some bounds on the Jacobson 2-radical and show that in certain groups, this radical can be explicitly found and the semisimple image determined.


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.











This page was built for publication: \(\mathcal{J}_{2}\) radical in automata nearrings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2929637)