#1214 ⟨
a
,
b
|
aabab
=
abbb
⟩
Up:
Monoid enumeration
Prev:
#1213
⟨
a
,
b
|
aabab
=
abba
⟩
Next:
#1215
⟨
a
,
b
|
aabab
=
baaa
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 9
Infinite non-cancellative non-commutative monoid
Element
a
has infinite order
Not left cancellative, because left multiplication by
a
is not injective:
a
⋅ (
ab
)
2
=
a
b
3
and
a
⋅
b
3
=
a
b
3
, however (
ab
)
2
≠
b
3
Not right cancellative, because right multiplication by
b
is not injective:
a
2
ba
⋅
b
=
a
b
3
and
a
b
2
⋅
b
=
a
b
3
, however
a
2
ba
≠
a
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
a
<
b
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
(
ab
)
2
⇒
a
b
3
[1]
# ab:aabab=abbb ab - - aabab=abbb