相关论文: Post-critically finite self-similar groups
This thesis has three goals related to the automorphism groups of finite $p$-groups. The primary goal is to provide a complete proof of a theorem showing that, in some asymptotic sense, the automorphism group of almost every finite…
Deterministic timed automata are strictly less expressive than their non-deterministic counterparts, which are again less expressive than those with silent transitions. As a consequence, timed automata are in general non-determinizable.…
We describe the infinite dihedral group as automaton group. We collect basic results and give full proofs in details for all statements.
In this paper we establish a general dynamical Central Limit Theorem (CLT) for group actions which are exponentially mixing of all orders. In particular, the main result applies to Cartan flows on finite-volume quotients of simple Lie…
Particle-like objects are observed to propagate and interact in many spatially extended dynamical systems. For one of the simplest classes of such systems, one-dimensional cellular automata, we establish a rigorous upper bound on the number…
We address the problem of determining the class of self-similar groups, and in particular its closure under restricted direct products. We show that the group $\mathbb Z^{(\omega)}$ is self-similar, that $G^{(\omega)}\rtimes C_2$ is…
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.…
In this paper, we study almost finiteness and almost finiteness in measure of non-free actions. Let $\alpha:G\curvearrowright X$ be a minimal action of a locally finite-by-virtually $\mathbb{Z}$ group $G$ on the Cantor set $X$. We prove…
A new class of languages of infinite words is introduced, called the max-regular languages, extending the class of $\omega$-regular languages. The class has two equivalent descriptions: in terms of automata (a type of deterministic counter…
We consider continuous structures which are obtained from finite dimensional Hilbert spaces over $\mathbb{C}$ by adding some unitary operators. Quantum automata and circuits are naturally interpretable in such structures. We consider…
We give the quantum subset construction of orthomodular lattice-valued finite automata, then we show the equivalence between orthomodular lattice-valued finite automata, orthomodular lattice-valued deterministic finite automata and…
In this paper we develop a dynamical scaling limit from rational dynamics to automata in tropical geometry. We compare these dynamics and induce uniform estimates of their orbits. We apply these estimates to introduce a comparison analysis…
The goal of the paper is to lay the foundation for the qualitative analogue of the classical, quantitative sparse graph limit theory. In the first part of the paper we introduce the qualitative analogues of the Benjamini-Schramm and…
We study constraint satisfaction problems (CSPs) where the constraint languages are defined by finite automata, giving rise to automata-based CSPs. The key notion is the concept of Automatic Constraint Satisfaction Problem ($AutCSP$), where…
We consider systems composed of an unbounded number of uniformly designed linear hybrid automata, whose dynamic behavior is determined by their relation to neighboring systems. We present a class of such systems and a class of safety…
We provide complementary results for a family of models with dependence on their previous $k$-sum. Using a martingale-based approach, we establish a functional central limit theorem and analyze the limiting behavior of the center of mass.…
In this work we extend our study on a link between automaticity and certain algebraic power series over finite fields. Our starting point is a family of sequences in a finite field of characteristic $2$, recently introduced by the first…
We show that any isometric action of a residually finite group admits approximate local finite models. As a consequence, if $G$ is residually finite, every isometric $G$-action embeds isometrically into a metric ultraproduct of finite…
We study Parikh automata on finite and infinite words. First we establish some results for Parikh automata on finite words. Following, we present several definitions of Parikh automata on infinite words. We consider the deterministic as…
Many of the numerous automaton models proposed in the literature can be regarded as a finite automaton equipped with an additional storage mechanism. In this thesis, we focus on two such models, namely the finite automata over groups and…