#27760 ⟨
a
,
b
|
aa
=1,
bbabbb
=
bba
⟩
Up:
Monoids with two generators and two relations
Prev:
#27759
⟨
a
,
b
|
aa
=1,
bbabbb
=
bab
⟩
Next:
#27761
⟨
a
,
b
|
aa
=1,
bbabbb
=
bbb
⟩
Properties
Presentation has sum-of-sides 11
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:
bb=c
a
2
⇒ 1
c
4
⇒
c
ca
c
3
⇒
ca
bc
⇒
c
3
cb
⇒
c
3
cab
⇒
ca
c
2
b
2
⇒
c
# ab:aa=1,bbabbb=bba ac/b bb=c frequency:2/0 aa=1 cccc=c caccc=ca bc=ccc cb=ccc cab=cacc bb=c
Right Cayley graph (truncated)
Left Cayley graph (truncated)
