#2574 ⟨
a
,
b
|
abaaab
=
babb
⟩
Up:
Monoids with two generators and one relation
Prev:
#2573
⟨
a
,
b
|
abaaab
=
baba
⟩
Next:
#2575
⟨
a
,
b
|
abaaab
=
bbaa
⟩
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
=
ba
b
2
and
bab
⋅
b
=
ba
b
2
, however
ab
a
3
≠
bab
Enveloping group: ⟨
a
,
b
|
aaabab
-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
b
<
a
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
ab
a
3
b
⇒
ba
b
2
[1]
2.
(
aba
)
2
b
2
⇒
ba
b
2
a
3
b
[2]
# ab:abaaab=babb ba abaaab=babb abaababb=babbaaab