#13244 ⟨
a
,
b
|
bab
=
aaa
,
bba
=
aa
⟩
Up:
Monoids with two generators and two relations
Prev:
#13243
⟨
a
,
b
|
baa
=
abb
,
bbb
=
bb
⟩
Next:
#13245
⟨
a
,
b
|
bab
=
aaa
,
bba
=
ab
⟩
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
5
⇒
a
4
b
a
4
⇒
b
a
3
ab
a
3
⇒
b
a
3
a
2
b
⇒
b
a
3
b
2
a
⇒
a
2
bab
⇒
a
3
# ab:bab=aaa,bba=aa a/b aaaaa=aaaa baaaa=baaa abaaa=baaa aab=baaa bba=aa bab=aaa
Right Cayley graph (truncated)
Left Cayley graph (truncated)
