#783 ⟨
a
,
b
|
aaabbbaa
=
a
⟩
Up:
Monoids with two generators and one relation
Prev:
#782
⟨
a
,
b
|
aaabbabb
=
b
⟩
Next:
#784
⟨
a
,
b
|
aaabbbaa
=
b
⟩
Quick links
Properties
Rewriting system
Properties
Presentation has sum-of-sides 9
Infinite non-cancellative non-commutative monoid
Not left cancellative, because left multiplication by
a
is not injective:
a
⋅
a
2
b
3
a
2
=
a
and
a
⋅ 1 =
a
, however
a
2
b
3
a
2
≠ 1
Not right cancellative, because right multiplication by
a
is not injective:
a
3
b
3
a
⋅
a
=
a
and 1 ⋅
a
=
a
, however
a
3
b
3
a
≠ 1
Enveloping group: ⟨
a
,
b
|
aaaabbb
⟩
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
b
3
a
2
⇒
a
2
b
3
a
[3]
2.
a
4
b
3
a
⇒
a
[4]
# ab:aaabbbaa=a ab abbbaa=aabbba aaaabbba=a