#19813 ⟨
a
,
b
|
aaa
=
a
,
abab
=
bbb
⟩
Up:
Monoids with two generators and two relations
Prev:
#19812
⟨
a
,
b
|
aaa
=
a
,
abab
=
bba
⟩
Next:
#19816
⟨
a
,
b
|
aaa
=
a
,
abba
=
aba
⟩
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
b
8
⇒
b
5
ba
b
4
⇒
a
b
6
b
3
ab
⇒
a
b
4
a
2
b
3
⇒
b
3
(
ab
)
2
⇒
b
3
a
3
⇒
a
# ab:aaa=a,abab=bbb b/a bbbbbbbb=bbbbb babbbb=abbbbbb bbbab=abbbb aabbb=bbb abab=bbb aaa=a
Right Cayley graph (truncated)
Left Cayley graph (truncated)
