#2598 ⟨
a
,
b
|
ababab
=
bbaa
⟩
Up:
Monoids with two generators and one relation
Prev:
#2597
⟨
a
,
b
|
ababab
=
baba
⟩
Next:
#2599
⟨
a
,
b
|
ababba
=
aaaa
⟩
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:
ab=c
ab
⇒
c
b
2
ac
⇒
c
3
b
cbac
⇒
a
c
3
b
b
2
a
2
⇒
c
3
cb
a
2
⇒
a
c
3
# ab:ababab=bbaa bc/a ab=c frequency:2/0 ab=c bbac=cccb cbac=acccb bbaa=ccc cbaa=accc
Right Cayley graph (truncated)
Left Cayley graph (truncated)