#1760 ⟨
a
,
b
|
abaaabbab
=
b
⟩
Up:
Monoids with two generators and one relation
Prev:
#1759
⟨
a
,
b
|
abaaabbab
=
a
⟩
Next:
#1761
⟨
a
,
b
|
abaaabbba
=
a
⟩
Quick links
Properties
Rewriting system
Properties
Presentation has sum-of-sides 10
Infinite non-cancellative non-commutative monoid
Not right cancellative, because right multiplication by
b
is not injective:
ab
a
3
b
2
a
⋅
b
=
b
and 1 ⋅
b
=
b
, however
ab
a
3
b
2
a
≠ 1
Enveloping group: ⟨
a
,
b
|
aabab
-1
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
a
<
b
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
b
a
3
b
2
ab
⇒
ab
a
3
b
3
[2]
2.
a
2
b
a
3
b
3
⇒
b
[3]
# ab:abaaabbab=b ab baaabbab=abaaabbb aabaaabbb=b