#5578 ⟨
a
,
b
,
c
|
ab
=
c
,
bbbc
=
c
⟩
Up:
Monoid enumeration
Prev:
#5575
⟨
a
,
b
,
c
|
ab
=
c
,
bbac
=
c
⟩
Next:
#5581
⟨
a
,
b
,
c
|
ab
=
c
,
bbca
=
c
⟩
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:
b
3
⋅
c
=
c
and 1 ⋅
c
=
c
, however
b
3
≠ 1
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
3
c
⇒
c
[2]
2.
ab
⇒
c
[1]
3.
ac
⇒
c
b
2
c
[3]
# abc:ab=c,bbbc=c bc/a - - bbbc=c ab=c ac=cbbc