Related papers: Syntactic Monoids in a Category
Categorical models of the exponential modality of linear logic will often, but not always, support an operation of differentiation. When they do, we speak of a monoidal differential modality; when they do not, we have merely a monoidal…
Given a regular language L, we effectively construct a unary semigroup that recognizes the topological closure of L in the free unary semigroup relative to the variety of unary semigroups generated by the pseudovariety R of all finite…
With the increased interest in machine learning, and deep learning in particular, the use of automatic differentiation has become more wide-spread in computation. There have been two recent developments to provide the theoretical support…
Dendric shifts are defined by combinatorial restrictions of the extensions of the words in their languages. This family generalizes well-known families of shifts such as Sturmian shifts, Arnoux-Rauzy shifts and codings of interval exchange…
The Eilenberg correspondence relates varieties of regular languages to pseudovarieties of finite monoids. Various modifications of this correspondence have been found with more general classes of regular languages on one hand and classes of…
Universal algebra uniformly captures various algebraic structures, by expressing them as equational theories or abstract clones. The ubiquity of algebraic structures in mathematics and related fields has given rise to several variants of…
We relate two measures of complexity of regular languages. The first is syntactic complexity, that is, the cardinality of the syntactic semigroup of the language. That semigroup is isomorphic to the semigroup of transformations of states…
In this paper we present general techniques for characterising minimal and maximal semigroup topologies on the endomorphism monoid $\operatorname{End}(\mathbb{A})$ of a countable relational structure $\mathbb{A}$. As applications, we show…
We study the classes of languages defined by valence automata with rational target sets (or equivalently, regular valence grammars with rational target sets), where the valence monoid is drawn from the important class of polycyclic monoids.…
A variety of algebras is called limit if it is non-finitely based but all its proper subvarieties are finitely based. A monoid is aperiodic if all its subgroups are trivial. We classify all limit varieties of aperiodic monoids with…
Given symmetric monoidal infinity-categories C and D, subject to mild hypotheses on D, we define an infinity-categorical analog of the Day convolution symmetric monoidal structure on the functor category Fun(C, D). An E_infinity monoid for…
We determine the combinatorics of transitive module categories over the monoidal category of finite dimensional $\mathfrak{sl}_3$-modules which arise when acting by the latter monoidal category on arbitrary simple $\mathfrak{sl}_3$-modules.…
Matching logic is a general formal framework for reasoning about a wide range of theories, with particular emphasis on programming language semantics. Notably, the intermediate language of the K semantics framework is an extension of…
We give a natural-deduction-style type theory for symmetric monoidal categories whose judgmental structure directly represents morphisms with tensor products in their codomain as well as their domain. The syntax is inspired by Sweedler…
This paper contributes to the techniques of topo-algebraic recognition for languages beyond the regular setting as they relate to logic on words. In particular, we provide a general construction on recognisers corresponding to adding one…
We study the syntactic complexity of finite/cofinite, definite and reverse definite languages. The syntactic complexity of a class of languages is defined as the maximal size of syntactic semigroups of languages from the class, taken as a…
In this paper, we introduce the notion of Autometrized lattice ordered monoids (for short,AL-monoids) as a generalization to DRl-semi groups. We obtain the basic properties of AL-monoids. Also, we prove that Autometrized lattice ordered…
The atoms of a regular language are non-empty intersections of complemented and uncomplemented quotients of the language. Tight upper bounds on the number of atoms of a language and on the quotient complexities of atoms are known. We…
We adapt the notion of an algebraic theory to work in the setting of quasicategories developed recently by Joyal and Lurie. We develop the general theory at some length. We study one extended example in detail: the theory of commutative…
We propose a generic categorical framework for learning unknown formal languages of various types (e.g. finite or infinite words, weighted and nominal languages). Our approach is parametric in a monad T that represents the given type of…