#14483 ⟨
a
,
b
|
aaab
=
b
,
aabab
=
a
⟩
Up:
Monoids with two generators and two relations
Prev:
#14482
⟨
a
,
b
|
aaab
=
b
,
aabaa
=
b
⟩
Next:
#14484
⟨
a
,
b
|
aaab
=
b
,
aabab
=
b
⟩
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.
bab
⇒
a
2
[3]
2.
a
4
⇒
a
[5]
3.
a
3
b
⇒
b
[1]
4.
b
a
3
⇒
b
[4]
# ab:aaab=b,aabab=a ab bab=aa aaaa=a aaab=b baaa=b