#5605 ⟨
a
,
b
|
aaabba
=
abaaa
⟩
Up:
Monoids with two generators and one relation
Prev:
#5604
⟨
a
,
b
|
aaabba
=
aabbb
⟩
Next:
#5606
⟨
a
,
b
|
aaabba
=
abaab
⟩
Quick links
Properties
Rewriting system
Properties
Presentation has sum-of-sides 11
Infinite non-cancellative non-commutative monoid
Not left cancellative, because left multiplication by
a
is not injective:
a
⋅
a
2
b
2
a
=
ab
a
3
and
a
⋅
b
a
3
=
ab
a
3
, however
a
2
b
2
a
≠
b
a
3
Not right cancellative, because right multiplication by
a
is not injective:
a
3
b
2
⋅
a
=
ab
a
3
and
ab
a
2
⋅
a
=
ab
a
3
, however
a
3
b
2
≠
ab
a
2
Enveloping group: ⟨
a
,
b
|
aabba
-1
a
-1
b
-1
⟩
Rewriting system
Format:
Pretty
Plain
Word to reduce:
Tips:
Lowercase letters stand for generators.
Spaces are ignored.
Numbers repeat the previous letter, e.g.
b90
.
Reduction strategy:
Leftmost
Rightmost
Path to normal form:
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
3
b
2
a
⇒
ab
a
3
[1]
# ab:aaabba=abaaa ab aaabba=abaaa