#1259 ⟨
a
,
b
|
ababa
=
abab
⟩
Up:
Monoids with two generators and one relation
Prev:
#1258
⟨
a
,
b
|
ababa
=
aabb
⟩
Next:
#1260
⟨
a
,
b
|
ababa
=
abba
⟩
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:
abab=c
ca
⇒
c
cb
⇒
abc
(
ab
)
2
⇒
c
# ab:ababa=abab ac/b abab=c magic:0 ca=c cb=abc abab=c
Right Cayley graph (truncated)
Left Cayley graph (truncated)
