相关论文: Preserving self-similarity in free products of sem…
The aim of this paper is to investigate whether the class of automaton semigroups is closed under certain semigroup constructions. We prove that the free product of two automaton semigroups that contain left identities is again an automaton…
We give a survey on results regarding self-similar and automaton presentations of free groups and semigroups and related products. Furthermore, we discuss open problems and results with respect to algebraic decision problems in this area.
We study automaton structures, i.e. groups, monoids and semigroups generated by an automaton, which, in this context, means a deterministic finite-state letter-to-letter transducer. Instead of considering only complete automata, we…
In this paper, we study algorithmic problems for automaton semigroups and automaton groups related to freeness and finiteness. In the course of this study, we also exhibit some connections between the algebraic structure of automaton…
This paper studies the class of automaton semigroups from two perspectives: closure under constructions, and examples of semigroups that are not automaton semigroups. We prove that (semigroup) free products of finite semigroups always arise…
A semigroup is completely simple if it has no proper ideals and contains a primitive idempotent. We say that a completely simple semigroup $S$ is a homogeneous completely simple semigroup if any isomorphism between finitely generated…
We introduce a new class of semigroups arising from a restricted class of asynchronous automata. We call these semigroups "expanding automaton semigroups." We show that the class of synchronous automaton semigroups is strictly contained in…
A group $G$ is called automatically continuous if any homomorphism from a completely metrizable or locally compact Hausdorff group to $G$ has open kernel. In this paper, we study preservation of automatic continuity under group-theoretic…
We consider necessary and sufficient conditions for finite generation and finite presentability for fiber products of free semigroups and free monoids. We give a necessary and sufficient condition on finite fiber quotients for a fiber…
For each group G which decomposes into a finitary direct product of free groups of finite rank we construct a regular band B such that the free idempotent generated semigroup over B contains a maximal subgroup isomorphic to G. In…
A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is a…
We use topological methods to study the maximal subgroups of the free idempotent generated semigroup on a biordered set. We use these to give an example of a free idempotent generated semigroup with maximal subgroup isomorphic to the free…
In a previous paper [1] [MR4101040], we initiated a systematic study of semihypergroups and had a thorough discussion about some important analytic and algebraic objects associated to this class of objects. In this paper, we investigate…
A homomorphism from a completely metrizable topological group into a free product of groups whose image is not contained in a factor of the free product is shown to be continuous with respect to the discrete topology on the range. In…
We prove that the semigroup generated by a reversible Mealy automaton contains a free subsemigroup of rank two if and only if it contains an element of infinite order.
In this paper we prove two new results about closed semigroups in the family of solvable groups H_{mn} that are semidirect products of R^m and R^n, and for which the structure homomorphism maps nontrivially into the center of Aut(R^n). The…
It was proved that for any finite set of elements of a free product of residually finite groups such that no two of them belong to conjugate cyclic subgroups and each of them do not belong to a subgroup which is conjugate a to free factor…
Let $A=A(x_{1},...,x_{n})$ be a free associative algebra in $\mathcal{A}$ freely generated over $K$ by a set $X=\{x_{1},...,x_{n}\}$, $End A$ be the semigroup of endomorphisms of $A$, and $Aut End A$ be the group of automorphisms of the…
We prove that for a free product $G$ with free factor system $\mathcal{G}$, any automorphism $\phi$ preserving $\mathcal{G}$, atoroidal (in a sense relative to $\mathcal{G}$) and none of whose power send two different conjugates of…
After reviewing automaton semigroups, we introduce Cayley Automata and the corresponding Cayley Automaton semigroups. We investigate which semigroups are isomorphic to their Cayley Automaton semigroup and give some results for special…