#2458 ⟨
a
,
b
|
aaabba
=
abab
⟩
Up:
Monoids with two generators and one relation
Prev:
#2457
⟨
a
,
b
|
aaabba
=
abaa
⟩
Next:
#2459
⟨
a
,
b
|
aaabba
=
abba
⟩
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(
b
) = deg(
c
) = 1,
b
<
c
Auxiliary generator:
abab=c
(
ab
)
2
⇒
c
a
3
b
2
a
⇒
c
cab
⇒
abc
cbab
⇒
a
3
b
2
c
c
a
2
b
2
a
⇒
a
3
b
2
c
# ab:aaabba=abab a/bc abab=c magic:0 abab=c aaabba=c cab=abc cbab=aaabbc caabba=aaabbc
Right Cayley graph (truncated)
Left Cayley graph (truncated)
