#19110 ⟨
a
,
b
|
aba
=
a
,
aabbaa
=
a
⟩
Up:
Monoids with two generators and two relations
Prev:
#19102
⟨
a
,
b
|
aba
=
a
,
aaabbb
=
a
⟩
Next:
#19114
⟨
a
,
b
|
aba
=
a
,
aabbba
=
a
⟩
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.
aba
⇒
a
[1]
2.
a
b
2
a
2
⇒
a
2
b
2
a
[3]
3.
a
3
b
2
a
⇒
a
[4]
# ab:aba=a,aabbaa=a ab aba=a abbaa=aabba aaabba=a