#5115 ⟨
a
,
b
|
aaabbba
=
bbba
⟩
Up:
Monoids with two generators and one relation
Prev:
#5114
⟨
a
,
b
|
aaabbba
=
bbab
⟩
Next:
#5116
⟨
a
,
b
|
aaabbba
=
bbbb
⟩
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
<
c
<
b
Auxiliary generators:
bbba
=
c
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
3
c
⇒
c
[4]
2.
b
3
a
⇒
c
[2]
3.
b
3
c
⇒
c
a
2
c
[5]
# ab:aaabbba=bbba acb bbba=c magic:0 aaac=c bbba=c bbbc=caac