Related papers: Post-critically finite self-similar groups
We explore the connections between automata, groups, limit spaces of self-similar actions, and tilings. In particular, we show how a group acting ``nicely'' on a tree gives rise to a self-covering of a topological groupoid, and how the…
This is Chapter 24 in the "AutoMathA" handbook. Finite automata have been used effectively in recent years to define infinite groups. The two main lines of research have as their most representative objects the class of automatic groups…
We study the class of groups generated by automata that act essentially freely on the boundary of a rooted tree. In the process we establish and discuss some general tools for determining if a group belongs to this class, and explore the…
We explore the relationship between limit spaces of contracting self-similar groups and self-similar structures. We give the condition on a contracting group such that its limit space admits a self-similar structure, and also the condition…
In this paper, we use a class of finite state automata, called topology automaton, to study the metric classification of a special class of post-critically finite self-similar sets. As an application, we prove that the conformal dimension…
Generalizing the idea of self-similar groups defined by Mealy automata, we itroduce the notion of a self-similar automaton and a self-similar group over a changing alphabet. We show that every finitely generated residually-finite group is…
This paper contains results related to synthesis and presentation of abstract automata by fragments of behaviour and investigates the structure of the classes of finite connected initial output-less automata specified by systems of defining…
We study the synchronous and asynchronous automatic structures on the fundamental group of a graph of groups in which each edge group is finite. Up to a natural equivalence relation, the set of biautomatic structures on such a graph product…
Every self-similar group acts on the space $X^\omega$ of infinite words over some alphabet $X$. We study the Schreier graphs $\Gamma_w$ for $w\in X^\omega$ of the action of self-similar groups generated by bounded automata on the space…
This paper discusses iterated monodromy groups for transcendental functions. We show that for every post-singularly finite entire transcendental function, the iterated monodromy action can be described by bounded activity automata of a…
We devise an algorithm which, given a bounded automaton A, decides whether the group generated by A is finite. The solution comes from a description of the infinite sequences having an infinite A-orbit using a deterministic finite-state…
The axioms of iteration theories, or iteration categories, capture the equational properties of fixed point operations in several computationally significant categories. Iteration categories may be axiomatized by the Conway identities and…
Cellular automata are arrays of finite state machines that can exist in a finite number of states. These machines update their states simultaneously based on specific local rules that govern their interactions. This framework provides a…
We explicitly determine the automorphism groups of all self-similar trees (a.k.a. trees with finitely many cone types). We show that any such automorphism group is a direct limit of certain finite products of finite symmetric groups, which…
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 discuss cellular automata over arbitrary finitely generated groups. We call a cellular automaton post-surjective if for any pair of asymptotic configurations, every pre-image of one is asymptotic to a pre-image of the other. The well…
We study natural linear representations of self-similar groups over finite fields. In particular, we show that if the group is generated by a finite automaton, then obtained matrices are automatic. This shows a new relation between two…
We introduce hypernode automata as a new specification formalism for hyperproperties of concurrent systems. They are finite automata with nodes labeled with hypernode logic formulas and transitions labeled with actions. A hypernode logic…
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…
Congruences for stochastic automata are defined, the correspondin factor automata are constructed and investigated for automata ove analytic spaces. We study the behavior under finite and infinite streams. Congruences consist of multiple…