#5038 ⟨
a
,
b
|
aaababa
=
aaab
⟩
Up:
Monoids with two generators and one relation
Prev:
#5037
⟨
a
,
b
|
aaababa
=
aaaa
⟩
Next:
#5039
⟨
a
,
b
|
aaababa
=
aaba
⟩
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
b
<
a
<
c
Auxiliary generators:
aaab
=
c
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
3
b
⇒
c
[2]
2.
caba
⇒
c
[4]
3.
c
a
2
b
⇒
cabc
[5]
# ab:aaababa=aaab bac aaab=c magic:0 aaab=c caba=c caab=cabc