#740 ⟨
a
,
b
|
aaaaabaa
=
b
⟩
Up:
Monoids with two generators and one relation
Prev:
#739
⟨
a
,
b
|
aaaaabaa
=
a
⟩
Next:
#741
⟨
a
,
b
|
aaaaabab
=
a
⟩
Quick links
Properties
Rewriting system
Properties
Presentation has sum-of-sides 9
Infinite cancellative non-commutative monoid
Submonoid of enveloping group: ⟨
a
,
b
|
aaaaabaab
-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
5
b
2
⇒
b
a
3
b
a
2
[2]
2.
a
5
bab
⇒
b
a
4
b
a
2
[3]
3.
a
5
b
a
2
⇒
b
[1]
# ab:aaaaabaa=b ba aaaaabb=baaabaa aaaaabab=baaaabaa aaaaabaa=b