#1718 ⟨
a
,
b
|
aabbaabba
=
b
⟩
Up:
Monoids with two generators and one relation
Prev:
#1717
⟨
a
,
b
|
aabbaabba
=
a
⟩
Next:
#1719
⟨
a
,
b
|
aabbabaab
=
a
⟩
Quick links
Properties
Rewriting system
Properties
Presentation has sum-of-sides 10
Infinite cancellative non-commutative monoid
Submonoid of enveloping group: ⟨
a
,
b
|
aabab
-1
b
-1
aab
-1
b
-1
⟩
Anti-isomorphic embedding:
φ
(
a
) =
a
,
φ
(
b
) =
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
2
b
3
⇒
ba
b
2
a
[2]
2.
(
a
2
b
2
)
2
a
⇒
b
[1]
# ab:aabbaabba=b ba aabbb=babba aabbaabba=b