#19595 ⟨
a
,
b
|
aab
=
b
,
babba
=
bb
⟩
Up:
Monoids with two generators and two relations
Prev:
#19594
⟨
a
,
b
|
aab
=
b
,
babba
=
ba
⟩
Next:
#19598
⟨
a
,
b
|
aab
=
b
,
babbb
=
ba
⟩
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:
Right-to-left recursive path with deg(
b
) = 0; deg(
a
) = 1
b
6
⇒
b
3
b
2
ab
⇒
b
4
a
ba
b
3
⇒
b
4
a
b
3
a
2
⇒
b
3
ba
b
2
a
⇒
b
2
a
2
b
⇒
b
# ab:aab=b,babba=bb reversed:b/a bbbbbb=bbb bbab=bbbba babbb=bbbba bbbaa=bbb babba=bb aab=b
Right Cayley graph (truncated)
Left Cayley graph (truncated)
