#15974 ⟨
a
,
b
|
aaa
=
aa
,
babb
=
aa
⟩
Up:
Monoids with two generators and two relations
Prev:
#15973
⟨
a
,
b
|
aaa
=
aa
,
baab
=
bb
⟩
Next:
#15975
⟨
a
,
b
|
aaa
=
aa
,
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(
a
) = 0; deg(
b
) = 1
a
3
⇒
a
2
(
ab
)
2
a
2
⇒
bab
a
2
a
2
b
2
⇒
bab
a
2
ba
b
2
⇒
a
2
# ab:aaa=aa,babb=aa a/b aaa=aa ababaa=babaa aabb=babaa babb=aa
Right Cayley graph (truncated)
Left Cayley graph (truncated)
