#1196 ⟨
a
,
b
|
aaabb
=
bbbb
⟩
Up:
Monoids with two generators and one relation
Prev:
#1195
⟨
a
,
b
|
aaabb
=
bbba
⟩
Next:
#1197
⟨
a
,
b
|
aabaa
=
aaaa
⟩
Quick links
Properties
Rewriting system
Properties
Presentation has sum-of-sides 9
Infinite non-cancellative non-commutative monoid
Not right cancellative, because right multiplication by
b
is not injective:
a
3
b
⋅
b
=
b
4
and
b
3
⋅
b
=
b
4
, however
a
3
b
≠
b
3
Enveloping group: ⟨
a
,
b
|
aaabb
⟩
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
3
b
2
⇒
b
4
[1]
# ab:aaabb=bbbb ab aaabb=bbbb