#5282 ⟨
a
,
b
|
abaaaab
=
aaab
⟩
Up:
Monoids with two generators and one relation
Prev:
#5281
⟨
a
,
b
|
abaaaab
=
aaaa
⟩
Next:
#5283
⟨
a
,
b
|
abaaaab
=
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
c
<
a
<
b
Auxiliary generators:
aaab
=
c
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
2
c
⇒
cac
[5]
2.
a
3
b
⇒
c
[2]
3.
abac
⇒
c
[4]
# ab:abaaaab=aaab cab aaab=c magic:0 aac=cac aaab=c abac=c