#1065 ⟨
a
,
b
|
aabaab
=
baa
⟩
Up:
Monoids with two generators and one relation
Prev:
#1064
⟨
a
,
b
|
aabaab
=
abb
⟩
Next:
#1066
⟨
a
,
b
|
aabaab
=
bab
⟩
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:
baa=c
c
2
b
⇒
bc
cacb
⇒
bac
a
2
cb
⇒
c
b
a
2
⇒
c
c
a
2
⇒
a
2
c
2
# ab:aabaab=baa bc/a baa=c magic:0 ccb=bc cacb=bac aacb=c baa=c caa=aacc
Right Cayley graph (truncated)
Left Cayley graph (truncated)
