#1063 ⟨
a
,
b
|
aabaab
=
aba
⟩
Up:
Monoids with two generators and one relation
Prev:
#1062
⟨
a
,
b
|
aabaab
=
aab
⟩
Next:
#1064
⟨
a
,
b
|
aabaab
=
abb
⟩
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:
aba=c
c
5
b
⇒
cbc
a
c
4
b
⇒
abc
ca
⇒
a
c
2
cba
⇒
abc
a
2
c
2
b
⇒
c
aba
⇒
c
# ab:aabaab=aba bc/a aba=c magic:0 cccccb=cbc accccb=abc ca=acc cba=abc aaccb=c aba=c
Right Cayley graph (truncated)
Left Cayley graph (truncated)
