#16100 ⟨
a
,
b
|
aab
=
aa
,
abaa
=
bb
⟩
Up:
Monoids with two generators and two relations
Prev:
#16098
⟨
a
,
b
|
aab
=
aa
,
abaa
=
ab
⟩
Next:
#16101
⟨
a
,
b
|
aab
=
aa
,
abab
=
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
5
⇒
a
2
a
2
b
⇒
a
2
b
2
⇒
ab
a
2
bab
a
2
⇒
ab
a
2
# ab:aab=aa,abaa=bb a/b aaaaa=aa aab=aa bb=abaa babaa=abaa
Right Cayley graph (truncated)
Left Cayley graph (truncated)
