#5268 ⟨
a
,
b
|
aabbbba
=
aabb
⟩
Up:
Monoids with two generators and one relation
Prev:
#5267
⟨
a
,
b
|
aabbbba
=
aaba
⟩
Next:
#5269
⟨
a
,
b
|
aabbbba
=
abaa
⟩
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:
aabb
=
c
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
2
b
2
⇒
c
[2]
2.
c
b
2
a
⇒
c
[4]
3.
ca
b
2
⇒
c
b
2
c
[5]
# ab:aabbbba=aabb bac aabb=c magic:0 aabb=c cbba=c cabb=cbbc