#12635 ⟨
a
,
b
|
babb
=
ab
,
bbbb
=
b
⟩
Up:
Monoids with two generators and two relations
Prev:
#12633
⟨
a
,
b
|
babb
=
aa
,
bbbb
=
b
⟩
Next:
#12637
⟨
a
,
b
|
babb
=
ba
,
bbbb
=
b
⟩
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:
Right-to-left recursive path with deg(
b
) = 0; deg(
c
) = deg(
a
) = 1,
c
<
a
Auxiliary generator:
ab=c
b
4
⇒
b
b
3
c
⇒
c
cb
⇒
b
2
c
ab
⇒
c
ac
⇒
b
c
2
# ab:babb=ab,bbbb=b reversed:b/ca ab=c frequency:2/0 bbbb=b bbbc=c cb=bbc ab=c ac=bcc
Right Cayley graph (truncated)
Left Cayley graph (truncated)
