Related papers: Semigroups Arising From Asynchronous Automata
We establish several extensions of the well-known Garden of Eden theorem for non-uniform cellular automata over the full shifts and over amenable group universes. In particular, our results describe quantitatively the relations between the…
We describe the development of the theory of automatic groups. We begin with a historical introduction, define the concepts of automatic, biautomatic and combable groups, derive basic properties, then explain how hyperbolic groups and the…
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…
Dickson's commutative semifields are an important class of finite division algebras. We generalise Dickson's construction of commutative division algebras by doubling both finite field extensions and central simple algebras and not…
Motivated by intuitive properties of physical quantities, the notion of a non-anomalous semigroup is formulated. These are totally ordered semigroups where there are no `infinitesimally close' elements. The real numbers are then defined as…
We extend the notion of activity for automaton semigroups and monoids introduced by Bartholdi, Godin, Klimann and Picantin to a more general setting. Their activity notion was already a generalization of Sidki's activity hierarchy for…
We define the class of groups of bounded type from tile inflations. These tile inflations also determine some automata describing the groups. In the case when the automata are stationary, we show that if the set of incompressible elements…
We study the action of groups generated by bounded activity automata with infinite alphabets on their orbital Schreier graphs. We introduce an amenability criterion for such groups based on the recurrence of the first level action. This…
We ascertain conditions and structures on categories and semigroups which admit the construction of pseudo-products and trace products respectively, making their connection as precise as possible. This topic is modelled on the ESN Theorem…
We consider sequences of finitely generated discrete subgroups Gamma_i=rho_i(Gamma) of a rank 1 Lie group G, where the representations rho_i are not necessarily faithful. We show that, for algebraically convergent sequences (Gamma_i),…
Cross-connection theory provides the construction of a semigroup from its ideal structure using small categories. A concordant semigroup is an idempotent-connected abundant semigroup whose idempotents generate a regular subsemigroup. We…
In this paper we consider the class of lambda-nondeterministic linear automata as a model of the class of linear languages. As usual in other automata models, lambda-moves do not increase the acceptance power. The main contribution of this…
The history, definition and principal properties of automatic groups and their generalisations to subgroups and cosets are reviewed briefly, mainly from a computational perspective. A result about the asynchronous automaticity of an HNN…
The partial automorphism monoid of an inverse semigroup is an inverse monoid consisting of all isomorphisms between its inverse subsemigroups. We prove that a tightly connected fundamental inverse semigroup $S$ with no isolated nontrivial…
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…
When a semigroup has a unary operation, it is possible to define two binary operations, namely, left and right division. In addition it is well known that groups can be defined in terms of those two divisions. The aim of this paper is to…
In this article, we first prove that the type of an affine semigroup ring is equal to the number of maximal elements of the Ap\'ery set with respect to the set of exponents of the monomials, which form a maximal regular sequence. Further,…
In this paper we characterize the congruence associated to the direct sum of all irreducible representations of a finite semigroup over an arbitrary field, generalizing results of Rhodes for the field of complex numbers. Applications are…
We construct a new family of Cayley automatic representations of semidirect products $\mathbb{Z}^n \rtimes_A \mathbb{Z}$ for which none of the projections of the normal subgroup $\mathbb{Z}^n$ onto each of its cyclic components is finite…
Dixon's famous theorem states that the group generated by two random permutations of a finite set is generically either the whole symmetric group or the alternating group. In the context of random generation of finite groups this means that…