#2504 ⟨
a
,
b
|
aababa
=
baab
⟩
Up:
Monoids with two generators and one relation
Prev:
#2503
⟨
a
,
b
|
aababa
=
baaa
⟩
Next:
#2505
⟨
a
,
b
|
aababa
=
baba
⟩
Properties
Presentation has sum-of-sides 10
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
) = 0; deg(
c
) = deg(
b
) = 1,
c
<
b
Auxiliary generator:
baab=c
bc
⇒
caba
b
a
2
c
⇒
c
a
2
b
a
2
bac
⇒
cab
b
a
2
b
⇒
c
a
2
(
ba
)
2
⇒
c
# ab:aababa=baab a/cb baab=c magic:0 bc=caba baac=caab aabac=cab baab=c aababa=c
Right Cayley graph (truncated)
Left Cayley graph (truncated)
