相关论文: Automata and Square Complexes

In the early 1990s Steve Gersten and Hamish Short proved that compact nonpositively curved triangle complexes have biautomatic fundamental groups and that compact nonpositively curved square complexes have biautomatic fundamental groups. In…

This paper seeks to build on the extensive connections that have arisen between automata theory, combinatorics on words, fractal geometry, and model theory. Results in this paper establish a characterization for the behavior of the fractal…

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…

We construct irreducible unitary representations of a finitely generated free group which are weakly contained in the left regular representation and in which a given linear combination of the generators has an eigenvalue. When the…

We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…

We introduce a tree structure for the iterates of symmetric bimodal maps and identify a subset which we prove to be isomorphic to the family of unimodal maps. This subset is used as a second factor for a $\ast $-product that we define in…

We introduce a novel technique to analyse unambiguous B\"uchi automata quantitatively, and apply this to the model checking problem. It is based on linear-algebra arguments that originate from the analysis of matrix semigroups with constant…

Finite automata are used to encode geometric figures, functions and can be used for image compression and processing. The original approach is to represent each point of a figure in $\mathbb{R}^n$ as a convolution of its $n$ coordinates…

We show that an automaton group or semigroup is infinite if and only if it admits an $\omega$-word (i. e. a right-infinite word) with an infinite orbit, which solves an open problem communicated to us by Ievgen V. Bondarenko. In fact, we…

In this triple of papers, we examine when two cycle-free partial orders can share an abstract automorphism group. This question was posed by M. Rubin in his memoir concerning the reconstruction of trees. In this middle paper, we adapt a…

We provide sufficient conditions for two subgroups of a hierarchically hyperbolic group to generate an amalgamated free product over their intersection. The result applies in particular to certain geometric subgroups of mapping class groups…

Finite automata were used to determine multiple addresses in number systems and to find topological properties of self-affine tiles and finite type fractals. We join these two lines of research by axiomatically defining automata which…

We show that the freeness problems for automaton semigroups and for automaton monoids are undecidable and, thereby, solve an open problem listed by Grigorchuk, Nekrashevych and Sush\-chansk\u{\i}i. We achieve this using a new technique to…

Pseudo-automorphisms are birational transformations acting as regular automorphisms in codimension 1. We import ideas from geometric group theory to prove that a group of birational transformations that satisfies a fixed point property on…

In this article we construct a piecewise Euclidean, non-positively curved 2-complex for the 3-generator Artin groups of large type. As a consequence we show that these groups are biautomatic. A slight modification of the proof shows that…

We show that the group of bounded automatic automorphisms of a rooted tree is amenable, which implies amenability of numerous classes of groups generated by finite automata. The proof is based on reducing the problem to showing amenability…

We present obstruction results for self-similar groups regarding the generation of free groups. As a main consequence of our main results, we solve an open problem posed by Grigorchuk by showing that in an automaton group where a…

In this article we define the semigroup associated to a substitution. We use it to construct a minimal automaton which generates a substitution sequence u in reverse reading. We show, in the case where the substitution has a coincidence,…

We propose a new approach to heap analysis through an abstract domain of automata, called automatic shapes. The abstract domain uses a particular kind of automata, called quantified data automata on skinny trees (QSDAs), that allows to…

We give a geometric approach to groups defined by automata via the notion of enriched dual of an inverse transducer. Using this geometric correspondence we first provide some finiteness results, then we consider groups generated by the dual…