#5736 ⟨
a
,
b
|
aabbaa
=
abbab
⟩
Up:
Monoids with two generators and one relation
Prev:
#5735
⟨
a
,
b
|
aabbaa
=
ababb
⟩
Next:
#5737
⟨
a
,
b
|
aabbaa
=
abbba
⟩
Quick links
Properties
Rewriting system
Properties
Presentation has sum-of-sides 11
Infinite non-cancellative non-commutative monoid
Not left cancellative, because left multiplication by
a
is not injective:
a
⋅
a
b
2
a
2
=
a
b
2
ab
and
a
⋅
b
2
ab
=
a
b
2
ab
, however
a
b
2
a
2
≠
b
2
ab
Enveloping group: ⟨
a
,
b
|
aabab
-1
aabb
⟩
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 recursive path with deg(
a
) = 0; deg(
b
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
b
2
ab
⇒
a
2
b
2
a
2
[1]
2.
a
2
b
2
a
(
ab
)
2
⇒
a
(
b
2
a
2
)
2
[2]
# ab:aabbaa=abbab a/b abbab=aabbaa aabbaabab=abbaabbaa