#19840 ⟨
a
,
b
|
aaa
=
a
,
babb
=
bba
⟩
Up:
Monoids with two generators and two relations
Prev:
#19839
⟨
a
,
b
|
aaa
=
a
,
babb
=
bab
⟩
Next:
#19841
⟨
a
,
b
|
aaa
=
a
,
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
ba
b
10
⇒
ba
b
4
b
2
a
⇒
ba
b
2
a
3
⇒
a
(
ba
)
3
b
2
⇒
ba
b
2
# ab:aaa=a,babb=bba b/a babbbbbbbbbb=babbbb bba=babb aaa=a babababb=babb
Right Cayley graph (truncated)
Left Cayley graph (truncated)
