#2341 ⟨
a
,
b
|
ababbba
=
bba
⟩
Up:
Monoids with two generators and one relation
Prev:
#2340
⟨
a
,
b
|
ababbba
=
bab
⟩
Next:
#2342
⟨
a
,
b
|
ababbba
=
bbb
⟩
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:
bbba=c
b
2
a
⇒
abac
b
2
c
⇒
cbac
(
ba
)
2
c
⇒
c
a
(
bac
)
2
⇒
bc
# ab:ababbba=bba ac/b bbba=c frequency:4/1 bba=abac bbc=cbac babac=c abacbac=bc
Right Cayley graph (truncated)
Left Cayley graph (truncated)
