#15969 ⟨
a
,
b
|
aaa
=
aa
,
abbb
=
ba
⟩
Up:
Monoids with two generators and two relations
Prev:
#15968
⟨
a
,
b
|
aaa
=
aa
,
abbb
=
ab
⟩
Next:
#15970
⟨
a
,
b
|
aaa
=
aa
,
abbb
=
bb
⟩
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(
b
) = 0; deg(
a
) = 1
ba
⇒
a
b
3
a
2
b
27
⇒
a
2
b
9
a
3
⇒
a
2
# ab:aaa=aa,abbb=ba b/a ba=abbb aabbbbbbbbbbbbbbbbbbbbbbbbbbb=aabbbbbbbbb aaa=aa
Right Cayley graph (truncated)
Left Cayley graph (truncated)
