#6559 ⟨
a
,
b
|
aaa
=
a
,
bbbb
=
aa
⟩
Up:
Monoids with two generators and two relations
Prev:
#6558
⟨
a
,
b
|
aaa
=
a
,
babb
=
bb
⟩
Next:
#6560
⟨
a
,
b
|
aaa
=
a
,
bbbb
=
ab
⟩
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
) = 0; deg(
a
) = 1
b
8
⇒
b
4
a
b
4
⇒
a
b
4
a
⇒
a
a
2
⇒
b
4
# ab:aaa=a,bbbb=aa b/a bbbbbbbb=bbbb abbbb=a bbbba=a aa=bbbb
Right Cayley graph (truncated)
Left Cayley graph (truncated)