#15838 ⟨
a
,
b
|
aba
=
aa
,
bbabb
=
b
⟩
Up:
Monoids with two generators and two relations
Prev:
#15836
⟨
a
,
b
|
aba
=
aa
,
babbb
=
b
⟩
Next:
#15840
⟨
a
,
b
|
aba
=
aa
,
bbbbb
=
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:
Left-to-right recursive path with deg(
b
) = 0; deg(
a
) = 1
ba
b
3
⇒
b
b
2
ab
⇒
ba
b
2
a
2
b
3
⇒
ab
aba
⇒
a
2
b
2
a
2
⇒
ba
b
2
a
# ab:aba=aa,bbabb=b b/a babbb=b bbab=babb aabbb=ab aba=aa bbaa=babba
Right Cayley graph (truncated)
Left Cayley graph (truncated)