#1096 ⟨
a
,
b
|
aabbba
=
aab
⟩
Up:
Monoids with two generators and one relation
Prev:
#1095
⟨
a
,
b
|
aabbba
=
aaa
⟩
Next:
#1097
⟨
a
,
b
|
aabbba
=
aba
⟩
Properties
Presentation has sum-of-sides 9
Infinite non-commutative monoid
Complete 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 recursive path with deg(
b
) = deg(
c
) = 0,
b
<
c
; deg(
a
) = 1
Auxiliary generator:
aab=c
cab
⇒
c
b
2
c
c
b
2
a
⇒
c
a
2
b
⇒
c
# ab:aabbba=aab bc/a aab=c magic:0 cab=cbbc cbba=c aab=c
Right Cayley graph (truncated)
Left Cayley graph (truncated)
