#4980 ⟨
a
,
b
|
aaaabba
=
aaab
⟩
Up:
Monoid enumeration
Prev:
#4979
⟨
a
,
b
|
aaaabba
=
aaaa
⟩
Next:
#4981
⟨
a
,
b
|
aaaabba
=
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
a
is not injective:
a
⋅
a
3
b
2
a
=
a
3
b
and
a
⋅
a
2
b
=
a
3
b
, however
a
3
b
2
a
≠
a
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
Auxiliary generators:
c
=
aaab
Reduction order:
Left-to-right shortlex with
a
<
b
<
c
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
3
b
⇒
c
[2]
2.
acba
⇒
c
[4]
3.
c
a
2
b
⇒
acbc
[5]
4.
c
2
ba
⇒
acbc
[6]
# ab:aaaabba=aaab abc aaab=c magic:0 aaab=c acba=c caab=acbc ccba=acbc