#1066 ⟨
a
,
b
|
aabaab
=
bab
⟩
Up:
Monoids with two generators and one relation
Prev:
#1065
⟨
a
,
b
|
aabaab
=
baa
⟩
Next:
#1067
⟨
a
,
b
|
aabaab
=
bba
⟩
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
2
b
a
2
⋅
b
=
bab
and
ba
⋅
b
=
bab
, however
a
2
b
a
2
≠
ba
Enveloping group: ⟨
a
,
b
|
aabab
-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
b
<
a
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
2
b
2
ab
⇒
bab
a
2
b
[2]
2.
(
a
2
b
)
2
⇒
bab
[1]
# ab:aabaab=bab ba aabbab=babaab aabaab=bab