#2425 ⟨
a
,
b
|
aaabaa
=
abaa
⟩
Up:
Monoids with two generators and one relation
Prev:
#2424
⟨
a
,
b
|
aaabaa
=
aabb
⟩
Next:
#2426
⟨
a
,
b
|
aaabaa
=
abab
⟩
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:
abaa=c
a
2
c
⇒
c
abc
⇒
c
2
ab
a
2
⇒
c
abac
⇒
cac
cbc
⇒
ca
c
2
cb
a
2
⇒
cac
cbac
⇒
c
(
ac
)
2
# ab:aaabaa=abaa ac/b abaa=c magic:0 aac=c abc=cc abaa=c abac=cac cbc=cacc cbaa=cac cbac=cacac
Right Cayley graph (truncated)
Left Cayley graph (truncated)
