Related papers: The smallest Mealy automaton of intermediate growt…
We consider the sequence ${J_m,m \ge 2}$ of the 3-state Mealy automata over an m-symbol alphabet such that the growth function of $J_m$ has the intermediate growth order $[n ^{{\log n}/{2 \log m}} ]$. For each automaton $J_m$ we describe…
We introduce the notion of composite growth function and provide examples that illustrate the primary properties of these growth functions. There are provided examples of Mealy automata that have composite non-monotonic growth functions of…
We consider a very simple Mealy machine (three states over a two-symbol alphabet), and derive some properties of the semigroup it generates. In particular, this is an infinite, finitely generated semigroup; we show that the growth function…
We prove that if the group generated by a Mealy automaton acts level-transitively on a regular rooted tree, then the semigroup generated by the dual automaton has exponential growth, hence giving a decision procedure of exponential growth…
The growth of a finitely generated group is an important geometric invariant which has been studied for decades. It can be either polynomial, for a well-understood class of groups, or exponential, for most groups studied by geometers, or…
We give an example of a 4-regular infinite automatic graph of intermediate growth. It is constructed as a Schreier graph of a certain group generated by 3-state automaton. The question was motivated by an open problem on the existence of…
The work introduces a 3D cellular automaton model for the spatial and crystallographic prediction of spherulite growth phenomena in polymers at the mesoscopic scale. The automaton is discrete in time, real space, and orientation space. The…
The growth function is the generating function for sizes of spheres around the identity in Cayley graphs of groups. We present a novel method to calculate growth functions for automatic groups with normal form recognizing automata that…
This paper shows how to construct explicitly an automaton that generates an arbitrary numerical semigroup.
Motivated by the Babai conjecture and the Cerny conjecture, we study the reset thresholds of automata with the transition monoid equal to the full monoid of transformations of the state set. For automata with $n$ states in this class, we…
We develop an effective and natural approach to interpret any semigroup admitting a special language of greedy normal forms as an automaton semigroup,namely the semigroup generated by a Mealy automaton encoding the behaviour of such a…
We study the geometry of a class of group extensions, containing permutational wreath products, which we call "permutational extensions". We construct for all natural number k a torsion group with growth function asymptotically…
For any group $G$ and set $A$, a cellular automaton over $G$ and $A$ is a transformation $\tau : A^G \to A^G$ defined via a finite neighborhood $S \subseteq G$ (called a memory set of $\tau$) and a local function $\mu : A^S \to A$. In this…
Motivated by the \v{C}ern\'y conjecture for automata, we introduce the concept of monoidal automata, which allows the formulation of the \v{C}ern\'y conjecture for monoids. We show upper bounds on the reset threshold of monoids with certain…
Using combinatorial properties of incomplete sets in a free monoid we construct a series of n-state deterministic automata with zero whose shortest synchronizing word has length n^2/4+n/2-1.
We give a new example of an automata group of intermediate growth. It is generated by an automaton with 4 states on an alphabet with 8 letters. This automata group has exponential activity and its limit space is not simply connected.
We study the LEF growth function of a finitely generated LEF group $\Gamma$, which measures the orders of finite groups admitting local embeddings of balls in a word metric on $\Gamma$. We prove that any sufficiently smooth increasing…
We consider any cancellative monoid $M$ equipped with a discrete degree map $deg:M\to R_{\ge0}$ and associated generating function $P(t)=\sum_{m\in M}t^{deg(m)}$, called the growth function of $M$. We also introduce, using some towers of…
We determine the asymptotic proportion of minimal automata, within n-state accessible deterministic complete automata over a k-letter alphabet, with the uniform distribution over the possible transition structures, and a binomial…
We develop an elementary theory of divisibility on the monoid $M(n,R)^\times$ consisting of all square matrices of size $n\ge 1$ of non-zero determinants with coefficients in a principal ideal domain $R$. In particular, we show that any…