#5742 ⟨
a
,
b
|
aabbaa
=
babbb
⟩
Up:
Monoids with two generators and one relation
Prev:
#5741
⟨
a
,
b
|
aabbaa
=
babab
⟩
Next:
#5743
⟨
a
,
b
|
aabbaa
=
bbabb
⟩
Quick links
Properties
Rewriting system
Properties
Presentation has sum-of-sides 11
Infinite cancellative non-commutative monoid
Submonoid of enveloping group: ⟨
a
,
b
|
aaabab
-1
b
-1
a
-1
a
-1
b
-1
b
-1
⟩
Embedding:
φ
(
a
) =
b
-1
,
φ
(
b
) =
a
-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 recursive path with deg(
a
) = 0; deg(
b
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
ba
b
3
⇒
a
2
b
2
a
2
[1]
2.
a
2
b
2
a
3
b
3
⇒
ba
(
b
2
a
2
)
2
[2]
# ab:aabbaa=babbb a/b babbb=aabbaa aabbaaabbb=babbaabbaa