#20142 ⟨
a
,
b
|
aab
=
b
,
babb
=
bba
⟩
Up:
Monoids with two generators and two relations
Prev:
#20141
⟨
a
,
b
|
aab
=
b
,
babb
=
bab
⟩
Next:
#20143
⟨
a
,
b
|
aab
=
b
,
babb
=
bbb
⟩
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
7
⇒
b
4
b
2
a
⇒
ba
b
2
a
2
b
⇒
b
(
ba
)
2
b
3
⇒
b
3
# ab:aab=b,babb=bba b/a bbbbbbb=bbbb bba=babb aab=b bababbb=bbb
Right Cayley graph (truncated)
Left Cayley graph (truncated)
