#2311 ⟨
a
,
b
|
abaabab
=
bba
⟩
Up:
Monoids with two generators and one relation
Prev:
#2310
⟨
a
,
b
|
abaabab
=
bab
⟩
Next:
#2312
⟨
a
,
b
|
abaabab
=
bbb
⟩
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
) = deg(
c
) = 0,
a
<
c
; deg(
b
) = 1
Auxiliary generator:
ab=c
ab
⇒
c
cba
⇒
aca
c
2
cbc
⇒
aca
c
2
b
b
2
a
⇒
ca
c
2
b
2
c
⇒
ca
c
2
b
# ab:abaabab=bba reversed:ac/b ab=c frequency:2/0 ab=c cba=acacc cbc=acaccb bba=cacc bbc=caccb
Right Cayley graph (truncated)
Left Cayley graph (truncated)
