#11369 ⟨
a
,
b
|
aabab
=
a
,
bbbbb
=1⟩
Up:
Monoids with two generators and two relations
Prev:
#11345
⟨
a
,
b
|
aabab
=
a
,
aabbb
=1⟩
Next:
#11371
⟨
a
,
b
|
aabab
=
b
,
aabbb
=1⟩
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
(
ba
)
2
⇒
a
a
(
ab
)
2
⇒
a
a
b
3
⇒ (
a
2
b
)
2
a
ab
(
ba
)
2
⇒
ab
(
a
2
b
)
3
a
⇒
a
b
2
b
5
⇒ 1
# ab:aabab=a,bbbbb=1 a/b ababa=a aabab=a abbb=aabaaba abbaba=ab aabaabaaba=abb bbbbb=1
Right Cayley graph (truncated)
Left Cayley graph (truncated)
