Related papers: Automatic Abelian Complexities of Parikh-Collinear…
The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Buchi, regular languages have been classified according to their descriptive complexity, i.e. the type of logical…
We prove that for any prime number $p$, every finite non-abelian $p$-group $G$ of class 2 has a noninner automorphism of order $p$ leaving either the Frattini subgroup $\Phi(G)$ or $\Omega_1(Z(G))$ elementwise fixed.
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…
The celebrated Kleene fixed point theorem is crucial in the mathematical modelling of recursive specifications in Denotational Semantics. In this paper we discuss whether the hypothesis of the aforementioned result can be weakened. An…
Regular languages -- the languages accepted by deterministic finite automata -- are known to be precisely the languages recognized by finite monoids. This characterization is the origin of algebraic language theory. In this paper, we…
The thesis deals with recognizing diffeomorphisms from fractal properties of discrete orbits, generated by iterations of such diffeomorphisms. The notion of fractal properties of a set refers to the box dimension, the Minkowski content and…
In this article we establish some results that allow to deduce the continuity of homomorphisms of (topological) abelian groups from commutative diagrams. In particular, we present a new topological version of the classical Five-Lemma. These…
In this paper, we develop a new method to classify abelian automorphism groups of hypersurfaces. We use this method to classify (Theorem 4.2) abelian groups that admit a liftable action on a smooth cubic fourfold. A parallel result (Theorem…
We study the pointed or copointed liftings of Nichols algebras associated to affine racks and constant cocycles for any finite group admitting a principal YD-realization of these racks. In the copointed case we complete the classification…
A new tool for the model theory of differentially closed fields and of compact complex manifolds is here developed. In such settings, it is shown that a type internal to the field of constants (resp. to the projective line) admits a maximal…
It is a consequence of existing literature that least and greatest fixed-points of monotone polynomials on Heyting algebras-that is, the algebraic models of the Intuitionistic Propositional Calculus-always exist, even when these algebras…
Let k be an algebraically closed field of characteristic zero, F its algebraically closed extension, and G be the group of k-automorphisms of F endowed with a natural topology. One of the purposes of this paper is to show that any…
Results of computational complexity exist for a wide range of phrase structure-based grammar formalisms, while there is an apparent lack of such results for dependency-based formalisms. We here adapt a result on the complexity of…
Monadic decomposibility --- the ability to determine whether a formula in a given logical theory can be decomposed into a boolean combination of monadic formulas --- is a powerful tool for devising a decision procedure for a given logical…
We investigate different notions of recognizability for a free monoid morphism $\sigma: \mathcal{A}^* \to \mathcal{B}^*$. Full recognizability occurs when each (aperiodic) point in $\mathcal{B}^\mathbb{Z}$ admits at most one tiling with…
We study the emptiness and $\lambda$-reachability problems for unary and binary Probabilistic Finite Automata (PFA) and characterise the complexity of these problems in terms of the degree of ambiguity of the automaton and the size of its…
It is well known that, under certain conditions, it is possible to split logic programs under stable model semantics, i.e. to divide such a program into a number of different "levels", such that the models of the entire program can be…
We prove that if the group of fixed points of a generic automorphism of a simple group of finite Morley rank is pseudofinite, then this group is an extension of a (twisted) Chevalley group over a pseudofinite field. On the way to obtain…
This paper grew out of three tutorial lectures on automatic structures given by the first author at the Logic Colloquium 2007. We discuss variants of automatic structures related to several models of computation: word automata, tree…
We show the surprising result that the cutpoint isolation problem is decidable for Probabilistic Finite Automata (PFA) where input words are taken from a letter-bounded context-free language. A context-free language $\mathcal{L}$ is…