#12537 ⟨
a
,
b
|
abab
=
ba
,
baaa
=
b
⟩
Up:
Monoids with two generators and two relations
Prev:
#12534
⟨
a
,
b
|
abab
=
ba
,
abbb
=
a
⟩
Next:
#12545
⟨
a
,
b
|
abab
=
ba
,
bbbb
=
b
⟩
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
3
⇒
b
a
3
b
⇒
b
bab
⇒
a
2
ba
a
b
2
⇒ (
b
a
2
)
2
(
a
2
b
)
2
⇒
b
2
a
b
2
a
2
b
⇒
ab
a
2
b
4
⇒
b
# ab:abab=ba,baaa=b a/b baaa=b aaab=b bab=aaba abb=baabaa aabaab=bba bbaab=abaa bbbb=b
Right Cayley graph (truncated)
Left Cayley graph (truncated)
