Related papers: A Categorical Approach to Syntactic Monoids
Stochastic automata over monoids as input sets are studied. The well-definedness of these automata requires an extension postulate that replaces the inherent universal property of free monoids. As a generalization of Turakainen's result, it…
The downward closure of a word language is the set of all (not necessarily contiguous) subwords of its members. It is well-known that the downward closure of any language is regular. While the downward closure appears to be a powerful…
Let $A$ be an alphabet and $SP^\diamond(A)$ denote the class of all countable N-free partially ordered sets labeled by $A$, in which chains are scattered linear orderings and antichains are finite. We characterize the rational languages of…
The vertices of any (combinatorial) Kashiwara crystal graph carry a natural monoid structure given by identifying words labelling vertices that appear in the same position of isomorphic components of the crystal. Working on a purely…
We develop the theory of locally rigid and rigid symmetric monoidal $\infty$-categories over an arbitrary base $\mathcal{V}\in\mathrm{CAlg}(\mathbf{Pr}^\mathrm{L})$. Among other things, we prove that every locally rigid commutative…
Finitary monads on $\mathsf{Pos}$ are characterized as the precisely the free-algebra monads of varieties of algebras. These are classes of ordered algebras specified by inequations in context. Analagously, finitary enriched monads on…
It is well-known that every regular language admits a unique minimal deterministic acceptor. Establishing an analogous result for non-deterministic acceptors is significantly more difficult, but nonetheless of great practical importance. To…
A symmetric monoidal category naturally arises as the mathematical structure that organizes physical systems, processes, and composition thereof, both sequentially and in parallel. This structure admits a purely graphical calculus. This…
We propose a framework of monoidal categorification of finite type cluster algebras involving triangulated monoidal categories. Namely, given a Dynkin quiver $Q$, we consider the bounded homotopy category $\mathcal{K}_Q^{(1)}$ of a…
Batanin and Markl's operadic categories are categories in which each map is endowed with a finite collection of "abstract fibres" -- also objects of the same category -- subject to suitable axioms. We give a reconstruction of the data and…
A monoid $M$ is said to be surjunctive if every injective cellular automaton with finite alphabet over $M$ is surjective. We show that monoid algebras of surjunctive monoids are stably finite. In other words, given any field $K$ and any…
The class of finitely presented algebras over a field $K$ with a set of generators $a_{1},..., a_{n}$ and defined by homogeneous relations of the form $a_{1}a_{2}... a_{n} =a_{\sigma (a)} a_{\sigma (2)} ... a_{\sigma (n)}$, where $\sigma$…
Let $K$ be a field. We attach to each finite poset $\mathbb P$ a von Neumann regular $K$-algebra $Q_K(\mathbb P)$ in a functorial way. We show that the monoid of isomorphism classes of finitely generated projective $Q_K(\mathbb P)$-modules…
We consider some questions about formal languages that arise when inverses of letters, words and languages are defined. The reduced representation of a language over the free monoid is its unique equivalent representation in the free group.…
The class of finitely presented algebras over a field $K$ with a set of generators $a_{1},\ldots , a_{n}$ and defined by homogeneous relations of the form $a_{1}a_{2}\cdots a_{n} =a_{\sigma (1)} a_{\sigma (2)} \cdots a_{\sigma (n)}$, where…
We provide an abstract categorical framework that relates the Cuntz semigroups of the C$^*$-algebras $A$ and $A\otimes \mathcal{K}$. This is done through a certain completion of ordered monoids by adding suprema of countable ascending…
This paper presents preliminary work on a general system for integrating dependent types into substructural type systems such as linear logic and linear type theory. Prior work on this front has generally managed to deliver type systems…
The starting point of algebraic language theory is that regular languages of finite words are exactly those recognized by finite monoids. This finiteness condition gives rise to a topological space whose points, called profinite words,…
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…
Motivated by potential applications to theoretical computer science, in particular those areas where the Curry-Howard correspondence plays an important role, as well as by the ongoing search in pure mathematics for feasible approaches to…