#2943 ⟨
a
,
b
,
c
|
aab
=
b
,
caa
=
b
⟩
Up:
Monoid enumeration
Prev:
#2942
⟨
a
,
b
,
c
|
aab
=
b
,
bcc
=
b
⟩
Next:
#2944
⟨
a
,
b
,
c
|
aab
=
b
,
caa
=
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
b
is not injective:
a
2
⋅
b
=
b
and 1 ⋅
b
=
b
, however
a
2
≠ 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 shortlex with
a
<
b
<
c
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
cb
⇒
b
2
[3]
2.
a
2
b
⇒
b
[1]
3.
c
a
2
⇒
b
[2]
4.
cab
⇒
bab
[4]
# abc:aab=b,caa=b abc - - cb=bb aab=b caa=b cab=bab