#1068 ⟨
a
,
b
|
aabaab
=
bbb
⟩
Up:
Monoid enumeration
Prev:
#1067
⟨
a
,
b
|
aabaab
=
bba
⟩
Next:
#1069
⟨
a
,
b
|
aababa
=
aaa
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 9
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
a
2
⋅
b
=
b
3
and
b
2
⋅
b
=
b
3
, however
a
2
b
a
2
≠
b
2
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
b
<
a
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
2
b
4
⇒
b
3
a
2
b
[2]
2.
(
a
2
b
)
2
⇒
b
3
[1]
# ab:aabaab=bbb ba - - aabbbb=bbbaab aabaab=bbb