#5151 ⟨
a
,
b
|
aabaabb
=
aaba
⟩
Up:
Monoid enumeration
Prev:
#5150
⟨
a
,
b
|
aabaabb
=
aaab
⟩
Next:
#5152
⟨
a
,
b
|
aabaabb
=
aabb
⟩
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
⋅
ab
a
2
b
2
=
a
2
ba
and
a
⋅
aba
=
a
2
ba
, however
ab
a
2
b
2
≠
aba
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
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
(
a
2
b
)
2
b
⇒
a
2
ba
[1]
# ab:aabaabb=aaba ab - - aabaabb=aaba