Results 1 to 10 of about 2,517 (95)
On Naturally Ordered Abundant Semigroups with an Adequate Monoid Transversal
In this paper, we study a class of naturally ordered abundant semigroups with an adequate monoid transversal, namely, naturally ordered concordant semigroups with an adequate monoid transversal.
Wei Chen
openalex +2 more sources
Finite basis problems for stalactic, taiga, sylvester and baxter monoids [PDF]
Stalactic, taiga, sylvester and Baxter monoids arise from the combinatorics of tableaux by identifying words over a fixed ordered alphabet whenever they produce the same tableau via some insertion algorithm.
B. Han, Wen Ting Zhang
semanticscholar +1 more source
The main motivation behind this paper is to study some structural properties of a non-associative structure as it hasn't attracted much attention compared to associative structures. In this paper, we introduce the concept of an ordered A*G**-groupoid and
Yousef Al-Qudah +3 more
semanticscholar +1 more source
The omega-inequality problem for concatenation hierarchies of star-free languages [PDF]
The problem considered in this paper is whether an inequality of omega-terms is valid in a given level of a concatenation hierarchy of star-free languages.
Almeida, J., Klíma, O., Kunc, M.
core +2 more sources
Schreier split extensions of preordered monoids [PDF]
Properties of preordered monoids are investigated and important subclasses of such structures are studied. The corresponding full subcategories of the category of preordered monoids are functorially related between them as well as with the categories of ...
Martins-Ferreira, Nelson +1 more
core +2 more sources
Eilenberg Theorems for Free [PDF]
Eilenberg-type correspondences, relating varieties of languages (e.g. of finite words, infinite words, or trees) to pseudovarieties of finite algebras, form the backbone of algebraic language theory.
Adámek, Jiří +3 more
core +2 more sources
Identities in the Algebra of Partial Maps [PDF]
We consider the identities of a variety of semigroup-related algebras modelling the algebra of partial maps. We show that the identities are intimately related to a weak semigroup deductive system and we show that the equational theory is decidable.
Jackson, Marcel, Stokes, Tim E.
core +2 more sources
Monoids with tests and the algebra of possibly non-halting programs [PDF]
We study the algebraic theory of computable functions, which can be viewed as arising from possibly non-halting computer programs or algorithms, acting on some state space, equipped with operations of composition, if-then-else and while-do defined in ...
Jackson, Marcel, Stokes, Tim E.
core +4 more sources
The Finite Basis Problem for Kiselman Monoids [PDF]
In an earlier paper, the second-named author has described the identities holding in the so-called Catalan monoids. Here we extend this description to a certain family of Hecke--Kiselman monoids including the Kiselman monoids $\mathcal{K}_n$.
Ashikhmin, D. N. +2 more
core +2 more sources
Completions of monoids with applications to the Cuntz semigroup [PDF]
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 sequences.
Ramon Antoine, J. Bosa, F. Perera
semanticscholar +1 more source

