#1425 ⟨
a
,
b
,
c
|
aa
=1,
bbc
=
bc
⟩
Up:
Monoid enumeration
Prev:
#1424
⟨
a
,
b
,
c
|
aa
=1,
bbc
=
bb
⟩
Next:
#1426
⟨
a
,
b
,
c
|
aa
=1,
bbc
=
ca
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 7
Infinite non-cancellative non-commutative monoid
Element
ba
has infinite order
Not left cancellative, because left multiplication by
b
is not injective:
b
⋅
bc
=
bc
and
b
⋅
c
=
bc
, however
bc
≠
c
Not right cancellative, because right multiplication by
c
is not injective:
b
2
⋅
c
=
bc
and
b
⋅
c
=
bc
, however
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 shortlex with
a
<
b
<
c
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
2
⇒ 1
[1]
2.
b
2
c
⇒
bc
[2]
# abc:aa=1,bbc=bc abc - - aa=1 bbc=bc