#1609 ⟨
a
,
b
,
c
|
aab
=
aa
,
cbc
=1⟩
Up:
Monoid enumeration
Prev:
#1608
⟨
a
,
b
,
c
|
aab
=
aa
,
cbb
=1⟩
Next:
#1611
⟨
a
,
b
,
c
|
aab
=
aa
,
ccb
=1⟩
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
a
is not injective:
a
⋅
ab
=
a
2
and
a
⋅
a
=
a
2
, however
ab
≠
a
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.
cb
⇒
bc
[3]
2.
a
2
b
⇒
a
2
[1]
3.
b
c
2
⇒ 1
[4]
4.
a
2
c
2
⇒
a
2
[5]
# abc:aab=aa,cbc=1 abc - - cb=bc aab=aa bcc=1 aacc=aa