#16033 ⟨
a
,
b
|
aaa
=
ab
,
bbab
=
aa
⟩
Up:
Monoids with two generators and two relations
Prev:
#16032
⟨
a
,
b
|
aaa
=
ab
,
bbaa
=
bb
⟩
Next:
#16034
⟨
a
,
b
|
aaa
=
ab
,
bbab
=
ab
⟩
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
ab
⇒
a
3
b
2
a
2
⇒
a
6
# ab:aaa=ab,bbab=aa a/b aaaaaaa=aa ab=aaa bbaa=aaaaaa
Right Cayley graph (truncated)
Left Cayley graph (truncated)
