Partial monoids: associativity and confluence

Details Partial monoids: associativity and confluence Partial monoids: associativity and confluence

2010-02-10

arxiv.org/abs/1002.2166v1

Journal of Pure and Applied Mathematics 3, 2 (2010) 265-285

Computer Science

Discrete Mathematics

Scientific paper

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 a string rewriting system on $P^*$ that consists in evaluating the concatenation of two letters as a product in $P$, when it is defined, and a letter $1_P$ as the empty word $\epsilon$. In this paper we study the profound relations between confluence for such a system and associativity of the multiplication. Moreover we develop a reduction strategy to ensure confluence and which allows us to define a multiplication on normal forms associative up to a given congruence of $P^*$. Finally we show that this operation is associative if, and only if, the rewriting system under consideration is confluent.

Affiliated with

Also associated with

No associations

Rating

Partial monoids: associativity and confluence does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Partial monoids: associativity and confluence, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Partial monoids: associativity and confluence will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-239562