Related papers: Characterizing classes of regular languages using …
We characterize, in terms of elementary properties, the abelian monoids which are direct limits of finite direct sums of monoids of the form $(Z/nZ)\sqcup\{0\}$ (where 0 is a new zero element), for positive integers $n$. The key properties…
We study distributional learning of context-free languages under a fixed recognizable congruence $\sim_h$ given as the kernel of an explicit finite monoid homomorphism $h:\Sigma^*\to M$. For this fixed-$h$ setting, we develop a finite typed…
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…
The coefficients of the local $h$-polynomial of the barycentric subdivision of the simplex with $n$ vertices are known to count derangements in the symmetric group $\mathfrak{S}_n$ by the number of excedances. A generalization of this…
Recently, Peeva and the second author constructed irreducible projective varieties with regularity much larger than their degree, yielding counterexamples to the Eisenbud-Goto Conjecture. Their construction involved two new ideas: Rees-like…
We combine the language of monoids with the language of preorders so as to refine some fundamental aspects of the classical theory of factorization and prove an abstract factorization theorem with a variety of applications. In particular,…
We study the task, for a given language $L$, of enumerating the (generally infinite) sequence of its words, without repetitions, while bounding the delay between two consecutive words. To allow for delay bounds that do not depend on the…
This paper is an extended version of our proceedings paper announced at LICS'16; in order to complement it, this version is written from a different viewpoint including topos-theoretic aspect on our work. Technically, this paper introduces…
Self-similar group actions may be encoded by a class of left cancellative monoids called left Rees monoids, a result obtained by combining pioneering work by Perrot with later work by the first author. Left Rees monoids that are also right…
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…
Series-parallel (SP) graphs are binary edge-labeled graphs with a designated source and target vertex, built using serial and parallel composition. A set of graphs is recognizable if membership depends only on its image under a homomorphism…
We associate a monoidal category $\mathcal{H}_B$, defined in terms of planar diagrams, to any graded Frobenius superalgebra $B$. This category acts naturally on modules over the wreath product algebras associated to $B$. To $B$ we also…
A large class of MDS linear codes is constructed. These codes are endowed with an efficient decoding algorithm. Both the definition of the codes and the design of their decoding algorithm only require from Linear Algebra methods, making…
Using twisted nearby cycles, we define a new notion of slopes for complex holonomic D-modules. We prove a boundedness result for these slopes, study their functoriality and use them to characterize regularity. For a family of (possibly…
We establish a Myhill-Nerode type theorem for higher-dimensional automata (HDAs), stating that a language is regular if and only if it has finite prefix quotient. HDAs extend standard automata with additional structure, making it possible…
Group languages are regular languages recognized by finite groups, or equivalently by finite automata in which each letter induces a permutation on the set of states. We investigate the separation problem for this class of languages: given…
We consider categories of Soergel bimodules for the symmetric groups S_n in their gl(n)-realizations for all n and assemble them into a locally linear monoidal bicategory. Chain complexes of Soergel bimodules likewise form a locally…
We propose foundations for a synthetic theory of $(\infty,1)$-categories within homotopy type theory. We axiomatize a directed interval type, then define higher simplices from it and use them to probe the internal categorical structures of…
A monoid is called special if it admits a presentation in which all defining relations are of the form $w = 1$. Every group is special, but not every monoid is special. In this article, we describe the language-theoretic properties of the…
Models of a generalized nondeterminism are defined by limitations on nonde- terministic behavior of a computing device. A regular realizability problem is a problem of verifying existence of a special sort word in a regular language. These…