#2666 ⟨
a
,
b
|
abaaa
=
aabab
⟩
Up:
Monoids with two generators and one relation
Prev:
#2665
⟨
a
,
b
|
abaaa
=
aaabb
⟩
Next:
#2667
⟨
a
,
b
|
abaaa
=
aabba
⟩
Quick links
Properties
Rewriting system
Properties
Presentation has sum-of-sides 10
Infinite non-cancellative non-commutative monoid
Not left cancellative, because left multiplication by
a
is not injective:
a
⋅
b
a
3
=
a
(
ab
)
2
and
a
⋅ (
ab
)
2
=
a
(
ab
)
2
, however
b
a
3
≠ (
ab
)
2
Enveloping group: ⟨
a
,
b
|
aaabba
-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
b
<
a
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
(
ab
)
2
⇒
ab
a
3
[1]
# ab:abaaa=aabab ba aabab=abaaa