#16465 ⟨
a
,
b
|
aba
=
bb
,
baab
=
bb
⟩
Up:
Monoids with two generators and two relations
Prev:
#16462
⟨
a
,
b
|
aba
=
bb
,
abbb
=
bb
⟩
Next:
#16467
⟨
a
,
b
|
aba
=
bb
,
babb
=
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(
b
) = 0; deg(
a
) = 1
b
6
⇒
b
3
a
b
5
⇒
a
b
2
ba
b
2
⇒
a
b
4
b
2
a
⇒
a
b
4
a
2
b
2
⇒
b
5
aba
⇒
b
2
b
a
2
b
⇒
b
2
# ab:aba=bb,baab=bb b/a bbbbbb=bbb abbbbb=abb babb=abbbb bba=abbbb aabb=bbbbb aba=bb baab=bb
Right Cayley graph (truncated)
Left Cayley graph (truncated)
