#12983 ⟨
a
,
b
|
abb
=
aaa
,
baab
=
b
⟩
Up:
Monoids with two generators and two relations
Prev:
#12982
⟨
a
,
b
|
abb
=
aaa
,
baab
=
a
⟩
Next:
#12984
⟨
a
,
b
|
abb
=
aaa
,
baba
=
a
⟩
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
9
⇒
a
3
ab
a
3
⇒
a
8
a
3
b
⇒
a
7
b
2
⇒
b
a
4
b
a
2
b
⇒
b
# ab:abb=aaa,baab=b a/b aaaaaaaaa=aaa abaaa=aaaaaaaa aaab=aaaaaaa bb=baaaa baab=b
Right Cayley graph (truncated)
Left Cayley graph (truncated)
