Related papers: Varieties of Data Languages
We study subsets of groups and monoids defined by language-theoretic means, generalizing the classical approach to the word problem. We expand on results by Herbst from 1991 to a more general setting, and for a class of languages…
In this note we show that any basic abelian variety with additional structures over an arbitrary algebraically closed field of characteristic $p>0$ is isogenous to another one defined over a finite field. We also show that the category of…
We present an expository overview of the monoidal structures in the category of linearly compact vector spaces. Bimonoids in this category are the natural duals of infinite-dimensional bialgebras. We classify the relations on words whose…
The article presents a new interpretation for Zipf-Mandelbrot's law in natural language which rests on two areas of information theory. Firstly, we construct a new class of grammar-based codes and, secondly, we investigate properties of…
The Dependent Object Types (DOT) calculus incorporates concepts from functional languages (e.g. modules) with traditional object-oriented features (e.g. objects, subtyping) to achieve greater expressivity (e.g. F-bounded polymorphism).…
Numerical characteristics of polynomial identities of left nilpotent algebras are examined. Previously, we came up with a construction which, given an infinite binary word, allowed us to build a two-step left nilpotent algebra with…
We introduce a class of real algebraic varieties characterised by a simple rationality condition, which exhibit strong properties regarding approximation of continuous and smooth mappings by regular ones. They form a natural counterpart to…
Let $d$ be a positive integer. In a previous article we established a bijective correspondence between the following classes of objects, considered up to the appropriate notion of equivalence: differential graded algebras with…
Two results on palindromicity of bi-infinite words in a finite alphabet are presented. The first is a simple, but efficient criterion to exclude palindromicity of minimal sequences and applies, in particular, to the Rudin-Shapiro sequence.…
We consider first-order logic with monoidal quantifiers over words. We show that all languages with a neutral letter, definable using the addition numerical predicate are also definable with the order predicate as the only numerical…
We give a finite axiomatization for the variety generated by relational, integral ordered monoids. As a corollary we get a finite axiomatization for the language interpretation as well.
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…
This paper explores the fine-grained structure of classes of regular languages maintainable in fragments of first-order logic within the dynamic descriptive complexity framework of Patnaik and Immerman. A result by Hesse states that the…
We investigate final coalgebras in nominal sets. This allows us to define types of infinite data with binding for which all constructions automatically respect alpha equivalence. We give applications to the infinitary lambda calculus.
Let $G$ be a unipotent group over a field of characteristic $p > 0$. The theory of character sheaves on $G$ was initiated by V. Drinfeld and developed jointly with D. Boyarchenko. They also introduced the notion of $\mathbb{L}$-packets of…
We introduce the notion of pseudo-algebraicity to study atomic models of first order theories (equivalently models of a complete sentence of $L_{\omega_1,\omega}$. Theorem: Let $T$ be any complete first-order theory in a countable language…
We establish theorems on the existence and compactness of solutions to the $\sigma_2$-Nirenberg problem on the standard sphere $\mathbb S^2$. A first significant ingredient, a Liouville type theorem for the associated fully nonlinear…
We consider fragments of first-order logic and as models we allow finite and infinite words simultaneously. The only binary relations apart from equality are order comparison < and the successor predicate +1. We give characterizations of…
Ten years ago, it was shown that nominal techniques can be used to design coalgebraic data types with variable binding, so that alpha-equivalence classes of infinitary terms are directly endowed with a corecursion principle. We introduce…
A theory of data types based on category theory is presented. We organize data types under a new categorical notion of F,G-dialgebras which is an extension of the notion of adjunctions as well as that of T-algebras. T-algebras are also used…