#2593 ⟨
a
,
b
|
ababab
=
abaa
⟩
Up:
Monoids with two generators and one relation
Prev:
#2592
⟨
a
,
b
|
ababab
=
aabb
⟩
Next:
#2594
⟨
a
,
b
|
ababab
=
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(
b
) = deg(
c
) = 0,
b
<
c
; deg(
a
) = 1
Auxiliary generator:
abaa=c
cab
⇒
abc
c
a
2
⇒ (
ab
)
2
c
cb
a
2
⇒
abac
cb
(
ab
)
2
⇒
abac
ab
a
2
⇒
c
(
ab
)
3
⇒
c
# ab:ababab=abaa bc/a abaa=c magic:0 cab=abc caa=ababc cbaa=abac cbabab=abac abaa=c ababab=c
Right Cayley graph (truncated)
Left Cayley graph (truncated)
