#2613 ⟨
a
,
b
|
ababba
=
bbba
⟩
Up:
Monoids with two generators and one relation
Prev:
#2612
⟨
a
,
b
|
ababba
=
bbab
⟩
Next:
#2614
⟨
a
,
b
|
ababba
=
bbbb
⟩
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
) = 0; deg(
c
) = deg(
b
) = 1,
c
<
b
Auxiliary generator:
bbba=c
b
3
a
⇒
c
aba
b
2
a
⇒
c
b
3
c
⇒
cba
b
2
a
aba
b
2
c
⇒
cba
b
2
a
# ab:ababba=bbba a/cb bbba=c magic:0 bbba=c ababba=c bbbc=cbabba ababbc=cbabba
Right Cayley graph (truncated)
Left Cayley graph (truncated)
