#5616 ⟨
a
,
b
|
aaabba
=
baabb
⟩
Up:
Monoids with two generators and one relation
Prev:
#5615
⟨
a
,
b
|
aaabba
=
baaba
⟩
Next:
#5617
⟨
a
,
b
|
aaabba
=
babaa
⟩
Quick links
Properties
Rewriting system
Properties
Presentation has sum-of-sides 11
Infinite cancellative non-commutative monoid
Submonoid of enveloping group: ⟨
a
,
b
|
aaabbab
-1
b
-1
a
-1
a
-1
b
-1
⟩
Embedding:
φ
(
a
) =
a
,
φ
(
b
) =
b
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
3
b
2
a
⇒
b
a
2
b
2
[1]
2.
a
3
b
3
a
2
b
2
⇒
b
(
a
2
b
2
)
2
a
[2]
# ab:aaabba=baabb ba aaabba=baabb aaabbbaabb=baabbaabba