#3521 ⟨
a
,
b
,
c
|
bb
=
ac
,
acb
=
c
⟩
Up:
Monoid enumeration
Prev:
#3520
⟨
a
,
b
,
c
|
bb
=
ac
,
acb
=
b
⟩
Next:
#3522
⟨
a
,
b
,
c
|
bb
=
ac
,
baa
=
a
⟩
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
b
is not injective:
a
b
2
⋅
b
=
b
2
and
b
⋅
b
=
b
2
, however
a
b
2
≠
b
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(
b
) = 0,
a
<
b
; deg(
c
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
b
3
⇒
b
2
[3]
2.
c
⇒
b
3
[2]
# abc:bb=ac,acb=c ab/c - - abbb=bb c=bbb