#6092 ⟨
a
,
b
,
c
|
ab
=
c
,
bcc
=
ba
⟩
Up:
Monoid enumeration
Prev:
#6091
⟨
a
,
b
,
c
|
ab
=
c
,
bcc
=
ac
⟩
Next:
#6093
⟨
a
,
b
,
c
|
ab
=
c
,
bcc
=
bb
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 8
Infinite non-cancellative non-commutative monoid
Element
a
has infinite order
Not left cancellative, because left multiplication by
b
is not injective:
b
⋅
c
2
b
=
bc
and
b
⋅
c
=
bc
, however
c
2
b
≠
c
Rewriting system
Format:
Pretty
Plain
Word:
Enter a word above to compute its normal form. Tips:
Lowercase letters stand for generators.
Spaces are ignored.
Numbers repeat the previous letter, e.g.
b90
.
Strategy:
Leftmost
Rightmost
Result:
1
1
Reduction order:
Left-to-right recursive path with deg(
b
) = deg(
c
) = 0,
b
<
c
; deg(
a
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
b
c
2
b
⇒
bc
[4]
2.
c
3
b
⇒
c
2
[5]
3.
ab
⇒
c
[1]
4.
ba
⇒
b
c
2
[2]
5.
ca
⇒
c
3
[3]
# abc:ab=c,bcc=ba bc/a - - bccb=bc cccb=cc ab=c ba=bcc ca=ccc