#1683 ⟨
a
,
b
|
aabaabbab
=
a
⟩
Up:
Monoids with two generators and one relation
Prev:
#1682
⟨
a
,
b
|
aabaabbaa
=
b
⟩
Next:
#1684
⟨
a
,
b
|
aabaabbab
=
b
⟩
Quick links
Properties
Rewriting system
Properties
Presentation has sum-of-sides 10
Infinite non-cancellative non-commutative monoid
Not left cancellative, because left multiplication by
a
is not injective:
a
⋅
ab
a
2
b
2
ab
=
a
and
a
⋅ 1 =
a
, however
ab
a
2
b
2
ab
≠ 1
Enveloping group: ⟨
a
,
b
|
aaabab
-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
2
b
)
2
bab
⇒
a
[1]
# ab:aabaabbab=a ab aabaabbab=a