#2606 ⟨
a
,
b
|
ababba
=
abbb
⟩
Up:
Monoids with two generators and one relation
Prev:
#2605
⟨
a
,
b
|
ababba
=
abba
⟩
Next:
#2607
⟨
a
,
b
|
ababba
=
baaa
⟩
Properties
Presentation has sum-of-sides 10
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
) = deg(
c
) = 0,
a
<
c
; deg(
b
) = 1
Auxiliary generator:
abbb=c
a
b
3
⇒
c
aba
b
2
a
⇒
c
c
b
3
⇒
aba
b
2
c
cba
b
2
a
⇒
aba
b
2
c
# ab:ababba=abbb ac/b abbb=c magic:0 abbb=c ababba=c cbbb=ababbc cbabba=ababbc
Right Cayley graph (truncated)
Left Cayley graph (truncated)
