#1269 ⟨
a
,
b
|
abbba
=
abab
⟩
Up:
Monoids with two generators and one relation
Prev:
#1268
⟨
a
,
b
|
abbba
=
aabb
⟩
Next:
#1270
⟨
a
,
b
|
abbba
=
abba
⟩
Properties
Presentation has sum-of-sides 9
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(
b
) = deg(
c
) = 0,
b
<
c
; deg(
a
) = 1
Auxiliary generator:
abab=c
cab
⇒
abc
cbab
⇒
a
b
3
c
c
b
2
a
⇒
abc
c
b
3
a
⇒
a
b
3
c
(
ab
)
2
⇒
c
a
b
3
a
⇒
c
# ab:abbba=abab bc/a abab=c magic:0 cab=abc cbab=abbbc cbba=abc cbbba=abbbc abab=c abbba=c
Right Cayley graph (truncated)
Left Cayley graph (truncated)
