#5070 ⟨
a
,
b
|
aaabbaa
=
aaab
⟩
Up:
Monoid enumeration
Prev:
#5069
⟨
a
,
b
|
aaabbaa
=
aaaa
⟩
Next:
#5071
⟨
a
,
b
|
aaabbaa
=
aaba
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 11
Infinite non-cancellative non-commutative monoid
Element
a
has infinite order
Not left cancellative, because left multiplication by
c
is not injective:
c
⋅
b
a
2
=
c
and
c
⋅ 1 =
c
, however
b
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
Auxiliary generators:
c
=
aaab
Reduction order:
Left-to-right shortlex with
b
<
a
<
c
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
cab
⇒
cbc
[5]
2.
a
3
b
⇒
c
[2]
3.
cb
a
2
⇒
c
[4]
4.
c
a
2
b
⇒
cbac
[6]
# ab:aaabbaa=aaab bac aaab=c magic:0 cab=cbc aaab=c cbaa=c caab=cbac