#13255 ⟨
a
,
b
|
bab
=
aba
,
bba
=
aa
⟩
Up:
Monoids with two generators and two relations
Prev:
#13254
⟨
a
,
b
|
bab
=
aab
,
bbb
=
bb
⟩
Next:
#13256
⟨
a
,
b
|
bab
=
aba
,
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
3
⇒
a
4
a
2
b
⇒
ab
a
2
b
2
a
⇒
a
2
bab
⇒
aba
# ab:bab=aba,bba=aa a/b aaaaa=aaaa baaa=aaaa aab=abaa bba=aa bab=aba
Right Cayley graph (truncated)
Left Cayley graph (truncated)
