#13247 ⟨
a
,
b
|
bab
=
aaa
,
bba
=
bb
⟩
Up:
Monoids with two generators and two relations
Prev:
#13246
⟨
a
,
b
|
bab
=
aaa
,
bba
=
ba
⟩
Next:
#13248
⟨
a
,
b
|
bab
=
aaa
,
bbb
=
aa
⟩
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
7
⇒
a
6
b
a
4
⇒
b
a
3
ab
a
3
⇒
b
a
3
a
3
b
⇒
b
a
3
b
2
⇒
a
6
bab
⇒
a
3
# ab:bab=aaa,bba=bb a/b aaaaaaa=aaaaaa baaaa=baaa abaaa=baaa aaab=baaa bb=aaaaaa bab=aaa
Right Cayley graph (truncated)
Left Cayley graph (truncated)
