#2576 ⟨
a
,
b
|
abaaab
=
bbab
⟩
Up:
Monoids with two generators and one relation
Prev:
#2575
⟨
a
,
b
|
abaaab
=
bbaa
⟩
Next:
#2577
⟨
a
,
b
|
abaaab
=
bbba
⟩
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:
Right-to-left recursive path with deg(
c
) = 0; deg(
a
) = deg(
b
) = 1,
a
<
b
Auxiliary generator:
ab=c
ab
⇒
c
b
2
c
⇒
c
a
2
c
ac
a
2
c
⇒
cbc
(
ac
)
2
bc
⇒
cbc
a
2
c
# ab:abaaab=bbab reversed:c/ab ab=c frequency:2/0 ab=c bbc=caac acaac=cbc acacbc=cbcaac
Right Cayley graph (truncated)
Left Cayley graph (truncated)
