#20132 ⟨
a
,
b
|
aab
=
b
,
baba
=
baa
⟩
Up:
Monoids with two generators and two relations
Prev:
#20119
⟨
a
,
b
|
aab
=
b
,
baaa
=
bbb
⟩
Next:
#20133
⟨
a
,
b
|
aab
=
b
,
baba
=
bab
⟩
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
b
a
4
⇒
b
a
2
a
2
b
⇒
b
b
2
a
⇒
b
a
3
(
ba
)
2
⇒
b
a
2
b
3
⇒
b
2
ba
b
2
⇒
bab
# ab:aab=b,baba=baa a/b baaaa=baa aab=b bba=baaa baba=baa bbb=bb babb=bab
Right Cayley graph (truncated)
Left Cayley graph (truncated)
