#2142 ⟨
a
,
b
|
aaaabba
=
bab
⟩
Up:
Monoids with two generators and one relation
Prev:
#2141
⟨
a
,
b
|
aaaabba
=
baa
⟩
Next:
#2143
⟨
a
,
b
|
aaaabba
=
bba
⟩
Quick links
Properties
Rewriting system
Properties
Presentation has sum-of-sides 10
Infinite cancellative non-commutative monoid
Submonoid of enveloping group: ⟨
a
,
b
|
aaaabbab
-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
4
b
2
a
⇒
bab
[1]
2.
a
4
b
3
ab
⇒
bab
a
3
b
2
a
[2]
# ab:aaaabba=bab ba aaaabba=bab aaaabbbab=babaaabba