Self-automaton semigroups.
The Cayley automaton \(C(S)\) of a finite semigroup \(S\) has state set \(S\) (when an element of \(S\) is considered as a state it is denoted with overlay); its input-output vocabulary is \(S\) and transition function \(\delta(\overline s,t)=(\overline{st},st)\), i.e. if automaton in state \(\overline s\in S\) receives input \(t\in S\), then its next state will be \(\overline{st}\) and output \(st\). Consider semigroup of outputs as \(|S|\)-ary rooted tree, then every state creates an endomorphism of this tree which is in natural way extended to sequences of states; this creates a homomorphism \(\Phi\colon S^+\to\mathrm{End}(S^*)\); a semigroup \(T\) is a Cayley automaton semigroup if there exists a semigroup \(S\) such that \(T\) is isomorphic to image of the homomorphism \(\Phi\). Here is investigated, which semigroups are isomorphic to their Cayley automaton semigroup (are self-automaton), e.g. it is shown, that a band is self-automaton iff its left-regular representation is faithful, i.e. for every \(a\in S\) the map \(\lambda_a\colon S\to S\), \(\lambda_a(x)=ax\) is injective.
- Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
- Automaton semigroups
- CAYLEY AUTOMATON SEMIGROUPS
- scientific article; zbMATH DE number 3287733 (Why is no real title available?)
- ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS
- ON THE CAYLEY SEMIGROUP OF A FINITE APERIODIC SEMIGROUP
This page was built for publication: Self-automaton semigroups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2346782)
