#2001 ⟨
a
,
b
|
aabbbaab
=
ab
⟩
Up:
Monoids with two generators and one relation
Prev:
#2000
⟨
a
,
b
|
aabbbaab
=
aa
⟩
Next:
#2002
⟨
a
,
b
|
aabbbaab
=
ba
⟩
Quick links
Properties
Rewriting system
Properties
Presentation has sum-of-sides 10
Infinite non-cancellative non-commutative monoid
Not left cancellative, because left multiplication by
a
is not injective:
a
⋅
a
b
3
a
2
b
=
ab
and
a
⋅
b
=
ab
, however
a
b
3
a
2
b
≠
b
Not right cancellative, because right multiplication by
b
is not injective:
a
2
b
3
a
2
⋅
b
=
ab
and
a
⋅
b
=
ab
, however
a
2
b
3
a
2
≠
a
Enveloping group: ⟨
a
,
b
|
aaabbb
⟩
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.
a
b
3
a
2
b
⇒
a
2
b
3
ab
[2]
2.
a
3
b
3
ab
⇒
ab
[3]
# ab:aabbbaab=ab ab abbbaab=aabbbab aaabbbab=ab