#2500 ⟨
a
,
b
|
aababa
=
abab
⟩
Up:
Monoids with two generators and one relation
Prev:
#2499
⟨
a
,
b
|
aababa
=
abaa
⟩
Next:
#2501
⟨
a
,
b
|
aababa
=
abba
⟩
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:
Right-to-left recursive path with deg(
a
) = 0; deg(
c
) = deg(
b
) = 1,
c
<
b
Auxiliary generator:
abab=c
aca
⇒
c
c
2
a
⇒
a
c
2
cb
⇒
a
2
bc
cab
⇒
abc
(
ab
)
2
⇒
c
# ab:aababa=abab reversed:a/cb abab=c magic:0 aca=c cca=acc cb=aabc cab=abc abab=c
Right Cayley graph (truncated)
Left Cayley graph (truncated)
