#19810 ⟨
a
,
b
|
aaa
=
a
,
abab
=
baa
⟩
Up:
Monoids with two generators and two relations
Prev:
#19809
⟨
a
,
b
|
aaa
=
a
,
abab
=
abb
⟩
Next:
#19811
⟨
a
,
b
|
aaa
=
a
,
abab
=
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
a
3
⇒
a
a
2
ba
⇒
ba
b
2
a
⇒
ba
bab
⇒
ab
a
2
# ab:aaa=a,abab=baa a/b aaa=a aaba=ba bba=ba bab=abaa
Right Cayley graph (truncated)
Left Cayley graph (truncated)
