#19694 ⟨
a
,
b
|
aba
=
a
,
babbb
=
aa
⟩
Up:
Monoids with two generators and two relations
Prev:
#19693
⟨
a
,
b
|
aba
=
a
,
babab
=
bb
⟩
Next:
#19697
⟨
a
,
b
|
aba
=
a
,
babbb
=
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(
a
) = 0; deg(
b
) = 1
a
7
⇒
a
2
b
a
2
⇒
a
6
aba
⇒
a
a
b
3
⇒
a
3
# ab:aba=a,babbb=aa a/b aaaaaaa=aa baa=aaaaaa aba=a abbb=aaa
Right Cayley graph (truncated)
Left Cayley graph (truncated)
