Knuth-Bendix algorithm and the conjugacy problems in monoids

Details Knuth-Bendix algorithm and the conjugacy problems in monoids Knuth-Bendix algorithm and the conjugacy problems in monoids

2010-12-16

arxiv.org/abs/1012.3547v1

Semigroup Forum: Volume 82, Issue 1 (2011), Page 181-196

Mathematics

Group Theory

This is a new version of the paper 'The conjugacy problems in monoids and semigroups'. This version will appear in the journal

Scientific paper

10.1007/s00233-010-9288-0

We present an algorithmic approach to the conjugacy problems in monoids,
using rewriting systems. We extend the classical theory of rewriting developed
by Knuth and Bendix to a rewriting that takes into account the cyclic
conjugates.

Affiliated with

Also associated with

No associations

Rating

Knuth-Bendix algorithm and the conjugacy problems in monoids 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 Knuth-Bendix algorithm and the conjugacy problems in monoids, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Knuth-Bendix algorithm and the conjugacy problems in monoids will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-218664