Related papers: Syntactic Monoids in a Category
This paper introduces and studies a categorical analogue of the familiar monoid semiring construction. By introducing an axiomatisation of summation that unifies notions of summation from algebraic program semantics with various notions of…
Let $G$ be a semisimple, simply connected algebraic group over an algebraically closed field of characteristic zero. We prove that the $\infty$-category of D-modules on the loop group of $G$ is equivalent to the monoidal colimit of the…
It often happens that free algebras for a given theory satisfy useful reasoning principles that are not preserved under homomorphisms of algebras, and hence need not hold in an arbitrary algebra. For instance, if $M$ is the free monoid on a…
During the last decades, classical models in language theory have been extended by control mechanisms defined by monoids. We study which monoids cause the extensions of context-free grammars, finite automata, or finite state transducers to…
Both topos theory and automata theory are known for their multi-faceted nature and relationship with topology, algebra, logic, and category theory. This paper aims to clarify the topos-theoretic aspects of automata theory, particularly…
Polynomials in a category have been studied as a generalization of the traditional notion in mathematics. Their construction has recently been extended to higher groupoids, as formalized in homotopy type theory, by Finster, Mimram, Lucas…
This paper investigates the class of finitely presented monoids defined by homogeneous (length-preserving) relations from a computational perspective. The properties of admitting a finite complete rewriting system, having finite derivation…
Recently, there has been renewed interest in the theory and applications of de Paiva's dialectica categories and their relationship to the category of polynomial functors. Both fall under the theory of generalized polynomial categories,…
Monads in category theory are algebraic structures that can be used to model computational effects in programming languages. We show how the notion of "centre", and more generally "centrality", i.e. the property for an effect to commute…
Let \(A=(A,\star)\) be a finite binary algebra, not necessarily associative. For each \(n\geq 1\), every full binary bracketing on \(x_1,\dots,x_n\) determines an \(n\)-ary term operation on \(A\), and hence an evaluation word obtained by…
In many situations one encounters an entity that resembles a monoid. It consists of a carrier and two operations that resemble a unit and a multiplication, subject to three equations that resemble associativity and left and right unital…
A leaf path language is a Boolean combination of sets of the form $\mathsf{{}^mE}^k L$, with $k \ge 1$ and $L$ a regular word language, which consist of those forests where the node labels in at least $k$ leaf-to-root paths make up a word…
This paper introduces an abstract notion of fragments of monadic second-order logic. This concept is based on purely syntactic closure properties. We show that over finite words, every logical fragment defines a lattice of languages with…
A synaptic algebra is a common generalization of several ordered algebraic structures based on algebras of self-adjoint operators, including the self-adjoint part of an AW*-algebra. In this paper we prove that a synaptic algebra A has the…
The category Set_* of sets and partial functions is well-known to be traced monoidal, meaning that a partial function S+U -/-> T+U can be coherently transformed into a partial function S -/-> T. This transformation is generally described in…
Let A be an associative algebra with identity over a field k. An atomistic subsemiring R of the lattice of subspaces of A, endowed with the natural product, is a subsemiring which is a closed atomistic sublattice. When R has no zero…
We investigate two operators on classes of regular languages: polynomial closure (Pol) and Boolean closure (Bool). We apply these operators to classes of group languages G and to their well-suited extensions G+, which is the least Boolean…
We prove that the closure of the one-sided Dyck language in a free monoid is a two-sided Dyck language.
We give equivalent conditions for a monomial sequence to be a d-sequence or a proper sequence, and a sufficient condition for a monomial sequence to be an s-sequence in order to compute invariants of the symmetric algebra of the ideal…
Regular synchronization languages can be used to define rational relations of finite words, and to characterize subclasses of rational relations, like automatic or recognizable relations. We provide a systematic study of the decidability of…