Related papers: Automata generating free products of groups of ord…
A loop is automorphic if all its inner mappings are automorphisms. We construct the free commutative automorphic $2$-generated loop of nilpotency class $3$. It has dimension $8$ over the integers.
Let $p(x) \in C(x)$ be a rational function satisfying the condition $p(0)=1$ and $q$ an integer larger than $1$, in this article we will consider the power expansion of the infinite product…
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…
In this paper, linear Cellular Automta (CA) rules are recursively generated using a binary tree rooted at "0". Some mathematical results on linear as well as non-linear CA rules are derived. Integers associated with linear CA rules are…
We study under which condition an amalgamated free product or an HNN-extension over a finite subgroup admits an amenable, transitive and faithful action on an infinite countable set. We show that such an action exists if the initial groups…
We conjecture that bounded generalised polynomial functions cannot be generated by finite automata, except for the trivial case when they are ultimately periodic. Using methods from ergodic theory, we are able to partially resolve this…
We prove that the set of subgroups of the automorphism group of a two-sided full shift is closed under countable graph products. We introduce the notion of a group action without $A$-cancellation (for an abelian group $A$), and show that…
We construct a commutative version of the group ring and show that it allows one to translate questions about the normal generation of groups into questions about the generation of ideals in commutative rings. We demonstrate this with an…
A BMW group of degree $(m,n)$ is a group that acts simply transitively on vertices of the product of two regular trees of degrees $m$ and $n$. We show that the number of commensurability classes of BMW groups of degree $(m,n)$ is bounded…
A finitary automaton group is a group generated by an invertible, deterministic finite-state letter-to-letter transducer whose only cycles are self-loops at an identity state. We show that, for this presentation of finite groups, the…
We adapt Safin's result on powers of sets in free groups to obtain Helfgott type growth in free products: if A is any finite subset of a free product of two arbitrary groups then either A is conjugate into one of the factors, or the size of…
Any algorithm (in the sense of Gurevich's abstract-state-machine axiomatization of classical algorithms) operating over any arbitrary unordered domain can be simulated by a dynamic cellular automaton, that is, by a pattern-directed cellular…
The transition structure of an automaton can be used to create a natural topology to the set of states of an automaton, generating, this way, a topological space. Probabilistic automata can also be modeled in terms of measure theory. A…
A result of Baumslag and Roseblade states that a finitely presented subgroup of the direct product of two free groups is virtually a direct product of free groups. In this paper we generalise this result to the class of cyclic subgroup…
We define a new strict and computable hierarchy for the family of automaton semigroups, which reflects the various asymptotic behaviors of the state-activity growth. This hierarchy extends that given by Sidki for automaton groups, and also…
Motivated by computational efficiency in algebraic automata theory here we define the cascade product of permutation groups as an external product, as a generic extension. It is the most general hierarchical product that uses arbitrary…
The knapsack problem is a classic optimisation problem that has been recently extended in the setting of groups. Its study reveals to be interesting since it provides many different behaviours, depending on the considered class of groups.…
We construct a new family of groups that is non-contracting and weakly regular branch over the derived subgroup. This gives the first example of an infinite family of groups acting on a $d$-adic tree, with $d \geq 2$, with these properties.
This paper is devoted to the proof of the property of order separability for free product of free groups with maximal cyclic amalgamated subgroups.
We give an amalgamation construction of free multiple trees with a strongly transitive automorphism group. The construction shows that any partial codistance function on a tuple of finite trees can be extended to yield multiple trees.