#24719 ⟨
a
,
b
|
aa
=
a
,
bbabbb
=
ba
⟩
Up:
Monoids with two generators and two relations
Prev:
#24718
⟨
a
,
b
|
aa
=
a
,
bbabbb
=
ab
⟩
Next:
#24720
⟨
a
,
b
|
aa
=
a
,
bbabbb
=
bb
⟩
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
12
⇒
ba
b
2
a
⇒
ba
b
9
a
2
⇒
a
(
ba
)
2
⇒
ba
b
9
# ab:aa=a,bbabbb=ba b/a babbbbbbbbbbbb=ba bba=babbbbbbbbb aa=a baba=babbbbbbbbb
Right Cayley graph (truncated)
Left Cayley graph (truncated)
