Related papers: Free operated monoids and Rewriting systems
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…
In this paper, we introduce monoidal rewriting systems (MRS), an abstraction of string rewriting in which reductions are defined over an arbitrary ambient monoid rather than a free monoid of words. This shift is partly motivated by logic:…
In this paper we construct free Hom-semigroups when its unary operation is multiplicative and is an involution. Our method of construction is by bracketed words. As a consequence, we obtain free Hom-associative algebras generated by a set…
We construct an informationally complete set of mutually unbiased - like bases for N ququarts. These bases are used in an explicit tomographic protocol which performance is analyzed by estimating quadratic errors and compared to other…
We study the complexity of computation in finitely generated free left, right and two-sided adequate semigroups and monoids. We present polynomial time (quadratic in the RAM model of computation) algorithms to solve the word problem and…
We consider various decision problems for automatic semigroups, which involve the provision of an automatic structure as part of the problem instance. With mild restrictions on the automatic structure, which seem to be necessary to make the…
We study the free objects in the variety of semigroups and variety of monoids generated by the monoid of all $n \times n$ upper triangular matrices over a commutative semiring. We obtain explicit representations of these, as multiplicative…
With a view on applications in computing, in particular concurrency theory and higher-dimensional rewriting, we develop notions of $n$-fold monoid and comonoid objects in $n$-fold monoidal categories and bicategories. We present a series of…
A free resolution of free partially commutative monoids is constructed and with its help the homological dimension of these monoids is calculated.
This paper studies the classes of semigoups and monoids with context-free and deterministic context-free word problem. First, some examples are exhibited to clarify the relationship between these classes and their connection with the…
We summarize the main known results involving subword reversing, a method of semigroup theory for constructing van Kampen diagrams by referring to a preferred direction. In good cases, the method provides a powerful tool for investigating…
This paper is the first in a sequence on the structure of sets of solutions to systems of equations over a free semigroup. To describe the structure, we present a Makanin-Razborov diagram that encodes the set of solutions to such system of…
In this paper we show how string rewriting methods can be applied to give a new method of computing double cosets. Previous methods for double cosets were enumerative and thus restricted to finite examples. Our rewriting methods do not…
Rewriting for semigroups is a special case of Groebner basis theory for noncommutative polynomial algebras. The fact is a kind of folklore but is not fully recognised. The aim of this paper is to elucidate this relationship, showing that…
In this paper we study rewriting systems for groups and monoids, focusing on situations where finite convergent systems may be difficult to find or do not exist. We consider systems which have no length increasing rules and are confluent…
Higher-dimensional rewriting systems are tools to analyse the structure of formally reducing terms to normal forms, as well as comparing the different reduction paths that lead to those normal forms. This higher structure can be captured by…
We study quotients of the magmatic operad, that is the free nonsymmetric operad over one binary generator. In the linear setting, we show that the set of these quotients admits a lattice structure and we show an analog of the Grassmann…
When a semigroup has a unary operation, it is possible to define two binary operations, namely, left and right division. In addition it is well known that groups can be defined in terms of those two divisions. The aim of this paper is to…
A partial monoid $P$ is a set with a partial multiplication $\times$ (and total identity $1_P$) which satisfies some associativity axiom. The partial monoid $P$ may be embedded in a free monoid $P^*$ and the product $\star$ is simulated by…
In this article is studied the construction of free operads functor, for the symmetric and non-symmetric case. In order to do this, the operads are seen as monoids on the differential graded modules category. In the last part we show some…