Related papers: Quasi-automatic groups are asynchronously automati…
Distributed automata are finite-state machines that operate on finite directed graphs. Acting as synchronous distributed algorithms, they use their input graph as a network in which identical processors communicate for a possibly infinite…
We construct a time-optimal quasi-solution of the firing mob synchronisation problem over finite, connected, and undirected multigraphs whose maximum degrees are uniformly bounded by a constant. It is only a quasi-solution because its…
In this paper, we consider various graphs, namely: power graph, cyclic graph, enhanced power graph and commuting graph, on a finite semigroup $S$. For an arbitrary pair of these four graphs, we classify finite semigroups such that the…
This paper shows how to construct explicitly an automaton that generates an arbitrary numerical semigroup.
A semigroup is \emph{amiable} if there is exactly one idempotent in each $\mathcal{R}^*$-class and in each $\mathcal{L}^*$-class. A semigroup is \emph{adequate} if it is amiable and if its idempotents commute. We characterize adequate…
We introduce a new geometric tool for analyzing groups of finite automata. To each finite automaton we associate a square complex. The square complex is covered by a product of two trees iff the automaton is bi-reversible. Using this method…
A finitely generated group is said to be an automata group if it admits a faithful self-similar finite-state representation on some regular $m$-tree. We prove that if $G$ is a subgroup of an automata group, then for each finitely generated…
Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagram semigroups in a general framework and extend our…
An automorphism of a graph is called quasi-semiregular if it fixes a unique vertex of the graph and its remaining cycles have the same length. This kind of symmetry of graphs was first investigated by Kutnar, Malni\v{c}, Mart\'{i}nez and…
By definition, a group $G$ is quasi-perfect, if $G$ is perfect or the commutator subgroup of $G$ is perfect. In this note we give a description of quasi-perfect Dyer groups by properties of the corresponding Dyer graphs.
We call an affine algebraic supergroup quasireductive if its underlying algebraic group is reductive. We obtain some results about the structure and representations of reductive supergroups.
A quasi-tree is a geodesic metric space quasi-isometric to a tree. We give a general construction of many actions of groups on quasi-trees. The groups we can handle include non-elementary (relatively) hyperbolic groups, rank 1 CAT(0)…
We describe the autotopism group Atp(G) of any abelian group G as being a semidirect product of its automorphism group Aut(G) and G^2. We then provide the subgroup structure of Atp(G) when G is a finite cyclic group.
We introduce "synchronous algebras", an algebraic structure tailored to recognize automatic relations (aka. synchronous relations, or regular relations). They are the equivalent of monoids for regular languages, however they conceptually…
In this paper we combine the algebraic properties of Mealy machines generating self-similar groups and the combinatorial properties of the corresponding deterministic finite automata (DFA). In particular, we relate bounded automata to…
We investigate the orbits of automaton semigroups and groups to obtain algorithmic and structural results, both for general automata but also for some special subclasses. First, we show that a more general version of the finiteness problem…
The action of any group on itself by conjugation and the corresponding conjugacy relation play an important role in group theory. There have been many attempts to find notions of conjugacy in semigroups that would be useful in special…
We explore a natural class of semigroups that have word problem decidable by finite state automata. Among the main results are invariance of this property under change of generators, invariance under basic algebraic constructions and…
For a numerical semigroup, we encode the set of primitive elements that are larger than its Frobenius number and show how to produce in a fast way the corresponding sets for its children in the semigroup tree. This allows us to present an…
In the spirit of peripheral subgroups in relatively hyperbolic groups, we exhibit a simple class of quasi-isometrically rigid subgroups in graph products of finite groups, which we call eccentric subgroups. As an application, we prove that,…