#12232 ⟨
a
,
b
|
aaab
=
aa
,
babb
=
a
⟩
Up:
Monoids with two generators and two relations
Prev:
#12224
⟨
a
,
b
|
aaab
=
aa
,
abbb
=
a
⟩
Next:
#12236
⟨
a
,
b
|
aaab
=
aa
,
bbab
=
a
⟩
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
b
a
2
⇒
a
4
a
2
b
⇒
a
4
(
ba
)
2
⇒
a
3
ba
b
2
⇒
a
# ab:aaab=aa,babb=a a/b aaaaa=aa baa=aaaa aab=aaaa baba=aaa babb=a
Right Cayley graph (truncated)
Left Cayley graph (truncated)
