#13245 ⟨
a
,
b
|
bab
=
aaa
,
bba
=
ab
⟩
Up:
Monoids with two generators and two relations
Prev:
#13244
⟨
a
,
b
|
bab
=
aaa
,
bba
=
aa
⟩
Next:
#13246
⟨
a
,
b
|
bab
=
aaa
,
bba
=
ba
⟩
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:
Right-to-left recursive path with deg(
b
) = 0; deg(
a
) = 1
b
8
a
⇒
b
5
a
ab
⇒
b
2
a
b
6
a
2
⇒
b
3
a
2
a
3
⇒
b
3
a
# ab:bab=aaa,bba=ab reversed:b/a bbbbbbbba=bbbbba ab=bba bbbbbbaa=bbbaa aaa=bbba
Right Cayley graph (truncated)
Left Cayley graph (truncated)
