#6111 ⟨
a
,
b
,
c
|
ab
=
c
,
ccc
=
bc
⟩
Up:
Monoid enumeration
Prev:
#6110
⟨
a
,
b
,
c
|
ab
=
c
,
ccc
=
ba
⟩
Next:
#6112
⟨
a
,
b
,
c
|
ab
=
c
,
ccc
=
cc
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 8
Infinite non-cancellative non-commutative monoid
Element
a
has infinite order
Not right cancellative, because right multiplication by
c
is not injective:
a
c
2
⋅
c
=
c
2
and
c
⋅
c
=
c
2
, however
a
c
2
≠
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(
a
) = deg(
c
) = 0,
a
<
c
; deg(
b
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
c
3
⇒
c
2
[3]
2.
bc
⇒
c
3
[2]
3.
ab
⇒
c
[1]
# abc:ab=c,ccc=bc ac/b - - accc=cc bc=ccc ab=c