#19825 ⟨
a
,
b
|
aaa
=
a
,
abbb
=
bab
⟩
Up:
Monoids with two generators and two relations
Prev:
#19824
⟨
a
,
b
|
aaa
=
a
,
abbb
=
baa
⟩
Next:
#19826
⟨
a
,
b
|
aaa
=
a
,
abbb
=
bba
⟩
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
a
b
15
⇒
a
b
9
bab
⇒
a
b
3
b
a
2
b
3
⇒
a
2
b
7
a
3
⇒
a
# ab:aaa=a,abbb=bab b/a abbbbbbbbbbbbbbb=abbbbbbbbb bab=abbb baabbb=aabbbbbbb aaa=a
Right Cayley graph (truncated)
Left Cayley graph (truncated)
