Related papers: Eilenberg Theorems for Free
We examine languages of unranked forests definable using the temporal operators EF and EX. We characterize the languages definable in this logic, and various fragments thereof, using the syntactic forest algebras introduced by Bojanczyk and…
In this paper we are interested in the existence of small and big Ramsey degrees of classes of finite unary algebras in arbitrary (not necessarily finite) algebraic language $\Omega$. We think of unary algebras as $M$-sets where $M =…
In this paper, for a given variety $\Var$, we present a universal algorithm for constructing a subvariety of $\Var$-dialgebras from which one can recover an algebra belonging to $\Var$. Such a subvariety is called the variety of initial…
The problems in variation here concerned are such as to admit a continuous group (in Lie's sense); the conclusions that emerge from the corresponding differential equations find their most general expression in the theorems formulated in…
We provide a new foundational approach to the generalization of terms up to equational theories. We interpret generalization problems in a universal-algebraic setting making a key use of projective and exact algebras in the variety…
The paper presents two new results concerning the varieties of Leibnitz algebras. We find values of multiplicities and colength variety of Leibniz algebras of almost polynomial growth, which is generated by the algebra constructed with the…
Many important computational structures involve an intricate interplay between algebraic features (given by operations on the underlying set) and relational features (taking account of notions such as order or distance). This paper…
Convolution is a ubiquitous operation in mathematics and computing. The Kripke semantics for substructural and interval logics motivates its study for quantale-valued functions relative to ternary relations. The resulting notion of…
We present a taxonomy of the variability mechanisms offered by modeling languages. The definition of a formal language encompasses a syntax and a semantic domain as well as the mapping that relates them, thus language variabilities are…
In [5] I.P. Goulden, D.M. Jackson, and R. Vakil formulated a conjecture relating certain Hurwitz numbers (enumerating ramified coverings of the sphere) to the intersection theory on a conjectural Picard variety. We are going to use their…
We investigate the model completeness of the theory of a mixed characteristic henselian valued field with finite ramification relative to the residue field and value group. We address the case in which the valued field has a value group…
This dissertation comprises three collections of results, all united by a common theme. The theme is the study of categories via algebraic techniques, considering categories themselves as algebraic objects. This algebraic approach to…
The \emph{word problem} of a group $G = \langle \Sigma \rangle$ can be defined as the set of formal words in $\Sigma^*$ that represent the identity in $G$. When viewed as formal languages, this gives a strong connection between classes of…
One of the main reasons for the correspondence of regular languages and monadic second-order logic is that the class of regular languages is closed under images of surjective letter-to-letter homomorphisms. This closure property holds for…
Linguistic similarity is multi-faceted. For instance, two words may be similar with respect to semantics, syntax, or morphology inter alia. Continuous word-embeddings have been shown to capture most of these shades of similarity to some…
I will discuss recent progress by many people in the program of extending natural topological invariants from manifolds to singular spaces. Intersection homology theory and mixed Hodge theory are model examples of such invariants. The past…
A systematic way of defining variants of a modeling language is useful for adapting the language to domain or project specific needs. Variants can be obtained by adapting the syntax or semantics of the language. In this paper, we take a…
We introduce two classes of morphisms over the alphabet $A=\{0,1\}$ whose fixed points contain infinitely many antipalindromic factors. An antipalindrome is a finite word invariant under the action of the antimorphism…
Starting with a combinatorial partition theorem for words over an infinite alphabet dominated by a fixed sequence, established recently by the authors, we prove recurrence results for topological dynamical systems indexed by such words. In…
Patterns are words with terminals and variables. The language of a pattern is the set of words obtained by uniformly substituting all variables with words that contain only terminals. In their original definition, patterns only allow for…