Related papers: Profinite trees, through Lawvere theories and the …
For every fixed class of regular languages, there is a natural hierarchy of increasingly more general problems: Firstly, the membership problem asks whether a given language belongs to the fixed class of languages. Secondly, the separation…
In the literature on Kleene algebra (KA), a number of variants have been proposed such as Kleene algebra with tests, commutative KA, bi-KA, and concurrent KA. The equational theories of some of these structures have then been studied in the…
Due to the works of S. Bozapalidis and A. Alexandrakis, there is a well-known characterization of recognizable weighted tree languages over fields in terms of finite-dimensionality of syntactic vector spaces. Here we prove a…
We give a proof of I. G. Rosenberg's characterization of maximal clones. The theorem lists six types of relations on a finite set such that a clone over this set is maximal if and only if it contains just the functions preserving one of the…
Various feature descriptions are being employed in logic programming languages and constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called features. The descriptions…
We give an explicit description of the free objects in the quasivariety of adequate semigroups, as sets of labelled directed trees under a natural combinatorial multiplication. The morphisms of the free adequate semigroup onto the free…
A class of languages C is perfect if it is closed under Boolean operations and the emptiness problem is decidable. Perfect language classes are the basis for the automata-theoretic approach to model checking: a system is correct if the…
In this article, we study the properties of profinite geometric iterated monodromy groups associated to polynomials. Such groups can be seen as generic representations of absolute Galois groups of number fields into the automorphism group…
A group is $\textit{finitely axiomatizable}$ (FA) in a class $\mathcal{C}$ if it can be determined up to isomorphism within $\mathcal{C}$ by a sentence in the first-order language of group theory. We show that profinite groups of various…
We define a class of languages of infinite words over infinite alphabets, and the corresponding automata. The automata used for recognition are a generalisation of deterministic Muller automata to the setting of nominal sets. Remarkably,…
We prove that it is decidable whether or not a finitely generated submonoid of a virtually free group is graded, introduce a new geometric characterization as quasi-geodesic monoids, and show that their word problem is rational (as a…
Regular word grammars are restricted context-free grammars that define all the recognizable languages of words. This paper generalizes regular grammars from words to certain classes of graphs, by defining regular grammars for unordered…
We propose FC, a new logic on words that combines finite model theory with the theory of concatenation - a first-order logic that is based on word equations. Like the theory of concatenation, FC is built around word equations; in contrast…
We undertake the study of profinite quandles. We provide several constructions of profinite quandles from profinite groups, and from other profinite quandle. We characterize which subquandles of profinite quandles are again profinite.…
We show that the set of all formulas in n variables valid in a finite class A of finite algebras is always a regular tree language, and compute a finite axiom set for A. We give a rational reconstruction of Barzdins' liquid flow algorithm…
We present our position on the elusive quest for a general-purpose framework for specifying and studying deep learning architectures. Our opinion is that the key attempts made so far lack a coherent bridge between specifying constraints…
The paper explains the connection between topological theories for one-manifolds with defects and values in the Boolean semiring and automata and their generalizations. Finite state automata are closely related to regular languages. To each…
This work is a contribution to the study of set of the representations of integers in a rational base number system. This prefix-closed subset of the free monoid is naturally represented as a highly non regular tree whose nodes are the…
While computer programs and logical theories begin by declaring the concepts of interest, be it as data types or as predicates, network computation does not allow such global declarations, and requires *concept mining* and *concept…
Regular tree grammars and regular path expressions constitute core constructs widely used in programming languages and type systems. Nevertheless, there has been little research so far on reasoning frameworks for path expressions where node…