#2456 ⟨
a
,
b
|
aaabba
=
aabb
⟩
Up:
Monoids with two generators and one relation
Prev:
#2455
⟨
a
,
b
|
aaabba
=
aaba
⟩
Next:
#2457
⟨
a
,
b
|
aaabba
=
abaa
⟩
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:
aabb=c
aca
⇒
c
c
2
a
⇒
a
c
2
c
b
2
⇒
a
2
c
2
a
2
b
2
⇒
c
ca
b
2
⇒
a
c
2
# ab:aaabba=aabb ac/b aabb=c magic:0 aca=c cca=acc cbb=aacc aabb=c cabb=acc
Right Cayley graph (truncated)
Left Cayley graph (truncated)
