#5624 ⟨
a
,
b
|
aaabba
=
bbabb
⟩
Up:
Monoids with two generators and one relation
Prev:
#5623
⟨
a
,
b
|
aaabba
=
bbaba
⟩
Next:
#5625
⟨
a
,
b
|
aaabba
=
bbbaa
⟩
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
b
-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
2
a
b
2
[1]
2.
a
3
b
4
a
b
2
⇒
b
2
(
a
b
2
a
)
2
[2]
# ab:aaabba=bbabb ba aaabba=bbabb aaabbbbabb=bbabbaabba