#2612 ⟨
a
,
b
|
ababba
=
bbab
⟩
Up:
Monoids with two generators and one relation
Prev:
#2611
⟨
a
,
b
|
ababba
=
bbaa
⟩
Next:
#2613
⟨
a
,
b
|
ababba
=
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:
Left-to-right recursive path with deg(
a
) = 0; deg(
c
) = deg(
b
) = 1,
c
<
b
Auxiliary generator:
bbab=c
abac
⇒
cb
b
2
c
⇒
ca
b
2
a
b
2
ac
⇒
cbab
b
2
ab
⇒
c
aba
b
2
a
⇒
c
# ab:ababba=bbab a/cb bbab=c magic:0 abac=cb bbc=cabba bbac=cbab bbab=c ababba=c
Right Cayley graph (truncated)
Left Cayley graph (truncated)
