#2573 ⟨
a
,
b
|
abaaab
=
baba
⟩
Up:
Monoids with two generators and one relation
Prev:
#2572
⟨
a
,
b
|
abaaab
=
baab
⟩
Next:
#2574
⟨
a
,
b
|
abaaab
=
babb
⟩
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
) = deg(
c
) = 0,
a
<
c
; deg(
b
) = 1
Auxiliary generator:
baba=c
cba
⇒
bac
caba
⇒
ab
a
3
c
c
a
2
b
⇒
bc
c
a
3
b
⇒
ab
a
2
c
(
ba
)
2
⇒
c
ab
a
3
b
⇒
c
# ab:abaaab=baba ac/b baba=c magic:0 cba=bac caba=abaaac caab=bc caaab=abaac baba=c abaaab=c
Right Cayley graph (truncated)
Left Cayley graph (truncated)
