#20181 ⟨
a
,
b
|
aba
=
a
,
aaaa
=
bbb
⟩
Up:
Monoids with two generators and two relations
Prev:
#20179
⟨
a
,
b
|
aba
=
a
,
aaaa
=
abb
⟩
Next:
#20182
⟨
a
,
b
|
aba
=
a
,
aaab
=
aaa
⟩
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
10
⇒
b
3
a
b
3
⇒
b
9
b
3
a
⇒
b
9
aba
⇒
a
a
4
⇒
b
3
# ab:aba=a,aaaa=bbb b/a bbbbbbbbbb=bbb abbb=bbbbbbbbb bbba=bbbbbbbbb aba=a aaaa=bbb
Right Cayley graph (truncated)
Left Cayley graph (truncated)