#1037 ⟨
a
,
b
|
aaabaa
=
baa
⟩
Up:
Monoids with two generators and one relation
Prev:
#1036
⟨
a
,
b
|
aaabaa
=
abb
⟩
Next:
#1038
⟨
a
,
b
|
aaabaa
=
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(
a
) = deg(
c
) = 0,
a
<
c
; deg(
b
) = 1
Auxiliary generator:
baa=c
a
3
c
⇒
c
bc
⇒
cac
b
a
2
⇒
c
bac
⇒
c
a
2
c
# ab:aaabaa=baa ac/b baa=c magic:0 aaac=c bc=cac baa=c bac=caac
Right Cayley graph (truncated)
Left Cayley graph (truncated)
