#5511 ⟨
a
,
b
|
aaaabb
=
ababa
⟩
Up:
Monoids with two generators and one relation
Prev:
#5510
⟨
a
,
b
|
aaaabb
=
abaab
⟩
Next:
#5512
⟨
a
,
b
|
aaaabb
=
ababb
⟩
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
3
b
2
=
a
(
ba
)
2
and
a
⋅ (
ba
)
2
=
a
(
ba
)
2
, however
a
3
b
2
≠ (
ba
)
2
Reduced enveloping group: ⟨
a
,
b
|
aaabba
-1
b
-1
a
-1
b
-1
=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
a
<
b
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
4
b
2
⇒
a
(
ba
)
2
[1]
# ab:aaaabb=ababa ab aaaabb=ababa