Related papers: Self-Automaton Semigroups

The finiteness problem for automaton groups and semigroups has been widely studied, several partial positive results are known. However we prove that, in the most general case, the problem is undecidable. We study the case of automaton…

We use a semigroup-theoretic construction by Peter Higgins in order to produce, for each even $n$, an $n$-state and 3-letter synchronizing automaton with the following two features: 1) all its input letters act as idempotent selfmaps of…

We show that the isomorphism problem is solvable in the class of central extensions of word-hyperbolic groups, and that the isomorphism problem for biautomatic groups reduces to that for biautomatic groups with finite centre. We describe an…

We study natural linear representations of self-similar groups over finite fields. In particular, we show that if the group is generated by a finite automaton, then obtained matrices are automatic. This shows a new relation between two…

A bialgebra is a structure which is simultaneously an algebra and a coalgebra, such that the algebraic and coalgebraic parts are "compatible". Bialgebras are normally studied over a field or commutative ring. In this paper, we show how to…

We introduce the inverse monoid of inner partial automorphisms of a semigroup -- a tool that associates to every semigroup an inverse semigroup. When the semigroup is a group, this inverse semigroup is isomorphic to the group of inner…

We introduce cellular automata whose cell spaces are left homogeneous spaces and prove a uniform as well as a topological variant of the Curtis-Hedlund-Lyndon theorem. Examples of left homogeneous spaces are spheres, Euclidean spaces, as…

We extend the usual definition of cellular automaton on a group in order to deal with a new kind of cellular automata, like cellular automata in the hyperbolic plane and we explore some properties of these cellular automata. This definition…

We show that for certain integers $n$, the problem of whether or not a Cayley digraph $\Gamma$ of $\mathbb Z_n$ is also isomorphic to a Cayley digraph of some other abelian group $G$ of order $n$ reduces to the question of whether or not a…

We describe in terms of automata theory the automatic actions with post-critically finite limit space. We prove that these actions are precisely the actions by bounded automata and that any self-similar action by bounded automata is…

In a couple of previous papers, we initiated a systematic study of semihypergroups and had a thorough discussion on certain analytic and algebraic aspects associated to this class of objects. In this article, we introduce and examine…

Let $S$ be a set of transpositions such that the girth of the transposition graph of $S$ is at least 5. It is shown that the automorphism group of the Cayley graph of the permutation group $H$ generated by $S$ is the semidirect product…

In this paper, we describe the automorphism group of semidirect product of two groups that fixes the non-normal subgroup of it. We have computed these automorphisms for the non-abelian metacyclic $p$-group and non-abelian $p$-groups $(p\ge…

Rational semigroups were introduced by Hinkkanen and Martin as a generalization of the iteration of a single rational map. There has subsequently been much interest in the study of rational semigroups. Quasiregular semigroups were…

We investigate the class of quasitrivial semigroups and provide various characterizations of the subclass of quasitrivial and commutative semigroups as well as the subclass of quasitrivial and order-preserving semigroups. We also determine…

Two new classes of finite automata, called General hexagonal Boustrophedon finite automata and General hexagonal returning finite automata operating on hexagonal grids, are introduced and analyzed. The work establishes the theoretical…

In this paper we initiate the study of $\aleph_0$-categorical semigroups, where a countable semigroup $S$ is $\aleph_0$-categorical if, for any natural number $n$, the action of its group of automorphisms Aut $S$ on $S^n$ has only finitely…

The notion of an automaton over a changing alphabet $X=(X_i)_{i\geq 1}$ is used to define and study automorphism groups of the tree $X^*$ of finite words over $X$. The concept of bi-reversibility for Mealy-type automata is extended to…

The split quartic Cayley algebra is a structurable algebra which has been used to give constructions of Lie algebras of type D4. Here, we calculate its group of automorphisms, its algebra of derivations and its gradings.

We prove a structure result on proper extensions of two-sided restriction semigroups in terms of partial actions, generalizing respective results for monoids and for inverse semigroups and upgrading the latter. We introduce and study…