Related papers: A Hierarchy of Tree-Automatic Structures

We show that every algebraic group scheme over a field with at least 8 elements can be realized as the group of automorphisms of a nonassociative algebra. This is only a modest improvement of the theorem of Gordeev and Popov (2003), but it…

For every positive integer $n$, we construct, using algebraic groups, an infinite family of irreducible algebraic varieties $X$,whose automorphism group ${\rm Aut}(X)$ contains the automorphism group ${\rm Aut}(F_n)$ of a free group $F_n$…

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 first paper, we give a…

The poset of copies of a relational structure ${\mathbb X}$ is the partial order $\langle {\mathbb P} ({\mathbb X}) ,\subset \rangle$, where ${\mathbb P} ({\mathbb X})=\{ Y\subset X: {\mathbb Y} \cong {\mathbb X}\}$. Investigating the…

A $\Lambda$-tree is a $\Lambda$-metric space satisfying three axioms (1), (2) and (3). We give a characterization of those ordered abelian groups $\Lambda$ for which axioms (1) and (2) imply axiom (3). As a special case, it follows that for…

The game tree languages can be viewed as an automata-theoretic counterpart of parity games on graphs. They witness the strictness of the index hierarchy of alternating tree automata, as well as the fixed-point hierarchy over binary trees.…

A simple Almost-Riemannian Structure on a Lie group G is defined by a linear vector field (that is an infinitesimal automorphism) and dim(G) -- 1 left-invariant ones. It is first proven that two different ARSs are isometric if and only if…

We study a categorical generalisation of tree automata, as $\Sigma$-algebras for a fixed endofunctor $\Sigma$ endowed with initial and final states. Under mild assumptions about the base category, we present a general minimisation algorithm…

In this paper, we look at an unambiguous version of Simon's forest factorization theorem, a very deep result which has wide connections in algebra, logic and automata. Given a morphism $\varphi$ from $\Sigma^+$ to a finite semigroup $S$, we…

A cohomology theory of root systems emerges naturally in the context of Automorphic Lie Algebras, where it helps formulating some structure theory questions. In particular, one can find concrete models for an Automorphic Lie Algebra by…

In this article we construct asynchronous and sometimes synchronous automatic structures for amalgamated products and HNN extensions of groups that are strongly asynchronously (or synchronously) coset automatic with respect to the…

An important step in the determination of the automorphism group of the quantum torus of rank $n$ (or twisted group algebra of $\mathbb Z^n$) is the determination of its so-called non-scalar automorphisms. We present a new algorithimic…

One of the major open problems in automata and logic is the following: is there an algorithm which inputs a regular tree language and decides if the language can be defined in first-order logic? The goal of this paper is to present this…

We study the class of quasi-alphabetic relations, i.e., tree transformations defined by tree bimorphisms with two quasi-alphabetic tree homomorphisms and a regular tree language. We present a canonical representation of these relations; as…

We show that a special case of the Feferman-Vaught composition theorem gives rise to a natural notion of automata for finite words over an infinite alphabet, with good closure and decidability properties, as well as several logical…

We prove that three automorphisms of the rooted binary tree defined by a certain 3-state automaton generate a free non-Abelian group of rank 3.

Let S be a complete star-omega semiring and Sigma be an alphabet. For a weighted omega-pushdown automaton P with stateset 1...n, n greater or equal to 1, we show that there exists a mixed algebraic system over a complete semiring-semimodule…

We compute the first $\ell^2$-Betti number of the automorphism and outer automorphism groups of arbitrary right-angled Artin groups (RAAGs), providing a complete characterization of when it is non-zero. We also analyse the algebraic fibring…

Let $\mathcal{M}_{n,d}$ be the moduli space of semi-stable rank $n$, trace-free Higgs bundles with fixed determinant of degree $d$ on a Riemann surface of genus at least $3$. We determine the following automorphism groups of…

We show that, from the topological point of view, 2-tape B\"uchi automata have the same accepting power as Turing machines equipped with a B\"uchi acceptance condition. The Borel and the Wadge hierarchies of the class RAT_omega of…