The Knuth-Bendix algorithm and the conjugacy problem in monoids

Fabienne Chouraqui

doi:10.1007/s00233-010-9288-0

The Knuth-Bendix algorithm and the conjugacy problem in monoids

Research output: Contribution to journal › Article › peer-review

Abstract

We present an algorithmic approach to the conjugacy problem 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.

Original language	English
Pages (from-to)	181-196
Number of pages	16
Journal	Semigroup Forum
Volume	82
Issue number	1
DOIs	https://doi.org/10.1007/s00233-010-9288-0
State	Published - Feb 2011
Externally published	Yes

Keywords

Braid monoid
Conjugacy problem
Rewriting system

ASJC Scopus subject areas

Algebra and Number Theory

Access to Document

10.1007/s00233-010-9288-0

Cite this

@article{c4a892b67cb04593b6f6694e0e730cba,

title = "The Knuth-Bendix algorithm and the conjugacy problem in monoids",

abstract = "We present an algorithmic approach to the conjugacy problem 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.",

keywords = "Braid monoid, Conjugacy problem, Rewriting system",

author = "Fabienne Chouraqui",

year = "2011",

month = feb,

doi = "10.1007/s00233-010-9288-0",

language = "English",

volume = "82",

pages = "181--196",

journal = "Semigroup Forum",

issn = "0037-1912",

publisher = "Springer New York",

number = "1",

}

TY - JOUR

T1 - The Knuth-Bendix algorithm and the conjugacy problem in monoids

AU - Chouraqui, Fabienne

PY - 2011/2

Y1 - 2011/2

N2 - We present an algorithmic approach to the conjugacy problem 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.

AB - We present an algorithmic approach to the conjugacy problem 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.

KW - Braid monoid

KW - Conjugacy problem

KW - Rewriting system

UR - https://www.scopus.com/pages/publications/78650996400

U2 - 10.1007/s00233-010-9288-0

DO - 10.1007/s00233-010-9288-0

M3 - Article

AN - SCOPUS:78650996400

SN - 0037-1912

VL - 82

SP - 181

EP - 196

JO - Semigroup Forum

JF - Semigroup Forum

IS - 1

ER -

The Knuth-Bendix algorithm and the conjugacy problem in monoids

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this