Related papers: Generators and Bases for Monadic Closures

Two very basic constructions involving experimental procedures are the formation of coarse-grained versions of experiments, and the formation of branching sequential experiments. The latter allow for the conditioning of states on the…

We give a definition of weak morphism of $T$-algebras, for a $2$-monad $T$, with respect to an arbitrary family $\Omega$ of $2$-cells of the base $2$-category. By considering particular choices of $\Omega$, we recover the concepts of lax,…

We provide a method to compute the pure magnets of the action of a diagonalizable monoid scheme on itself. This is described in terms of minimal generators of the sharp monoid obtained quotienting by the face of invertible elements. In…

For any finite dimensional basic associative algebra, we study the presentation spaces and their relation with the representation spaces. We prove two propositions about a general presentation, one on its subrepresentations and the other on…

We exhibit an adjunction between a category of abstract algebras of partial functions and a category of set quotients. The algebras are those atomic algebras representable as a collection of partial functions closed under relative…

Due to the works of S. Bozapalidis and A. Alexandrakis, there is a well-known characterization of recognizable weighted tree languages over fields in terms of finite-dimensionality of syntactic vector spaces. Here we prove a…

We give a complete description of quadratic potential and twisted potential algebras on 3 generators as well as cubic potential and twisted potential algebras on 2 generators up to graded algebra isomorphisms under the assumption that the…

We display a new family of prime ideals with unbounded minimal number of generators in a three-dimensional power series ring over a field of characteristic zero. These primes are obtained as the kernel of a quasi-monomial algebra…

These are lecture notes on the algebraic approach to regular languages. The classical algebraic approach is for finite words; it uses semigroups instead of automata. However, the algebraic approach can be extended to structures beyond…

Let $A=\{{\bf a}_1,...,{\bf a}_m\} \subset \mathbb{Z}^n$ be a vector configuration and $I_A \subset K[x_1,...,x_m]$ its corresponding toric ideal. The paper consists of two parts. In the first part we completely determine the number of…

Abstract clones serve as an algebraic presentation of the syntax of a simple type theory. From the perspective of universal algebra, they define algebraic theories like those of groups, monoids and rings. This link allows one to study the…

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,…

Inspired by distributed algorithms, we introduce a new class of finite graph automata that recognize precisely the graph languages definable in monadic second-order logic. For the cases of words and trees, it has been long known that the…

We present a general coalgebraic setting in which we define finite and infinite behaviour with B\"uchi acceptance condition for systems whose type is a monad. The first part of the paper is devoted to presenting a construction of a monad…

We consider the classical problem of determining the largest possible cardinality of a minimal presentation of a numerical monoid with given embedding dimension and multiplicity. Very few values of this cardinality are known. In addressing…

This is a simple way rigorously to construct Grassmann, Clifford and Geometric Algebras, allowing degenerate bilinear forms, infinite dimension, using fields or certain modules (characteristic 2 with limitation) - and characterize the…

We investigate the possibility of deriving metric trace semantics in a coalgebraic framework. First, we generalize a technique for systematically lifting functors from the category Set of sets to the category PMet of pseudometric spaces,…

Cylindrical Algebraic Decomposition (CAD) algorithms typically produce a decomposition adapted to a finite family of semi-algebraic sets $\mathcal{F}$ (i.e. every member of $\mathcal{F}$ is a union of cells). Different algorithms may…

Let $\Lambda$ be an artin algebra. We are going to consider full subcategories of $\mod\Lambda$ closed under finite direct sums and under submodules with infinitely many isomorphism classes of indecomposable modules. The main result asserts…

Automata learning is a popular technique for inferring minimal automata through membership and equivalence queries. In this paper, we generalise learning to the theory of coalgebras. The approach relies on the use of logical formulas as…