#6272 ⟨
a
,
b
|
aaa
=
a
,
babbb
=
a
⟩
Up:
Monoids with two generators and two relations
Prev:
#6271
⟨
a
,
b
|
aaa
=
a
,
babab
=
b
⟩
Next:
#6273
⟨
a
,
b
|
aaa
=
a
,
babbb
=
b
⟩
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
a
b
24
⇒
a
ba
⇒
a
b
21
a
3
⇒
a
# ab:aaa=a,babbb=a b/a abbbbbbbbbbbbbbbbbbbbbbbb=a ba=abbbbbbbbbbbbbbbbbbbbb aaa=a
Right Cayley graph (truncated)
Left Cayley graph (truncated)
