#11345 ⟨
a
,
b
|
aabab
=
a
,
aabbb
=1⟩
Up:
Monoids with two generators and two relations
Prev:
#11343
⟨
a
,
b
|
aabaa
=
b
,
bbbbb
=1⟩
Next:
#11369
⟨
a
,
b
|
aabab
=
a
,
bbbbb
=1⟩
Quick links
Properties
Rewriting system
Properties
Presentation has sum-of-sides 11
Infinite non-commutative monoid
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
(
ab
)
2
⇒
a
[1]
2.
a
2
b
3
⇒ 1
[2]
# ab:aabab=a,aabbb=1 ab aabab=a aabbb=1