#2251 ⟨
a
,
b
|
aababba
=
bba
⟩
Up:
Monoids with two generators and one relation
Prev:
#2250
⟨
a
,
b
|
aababba
=
bab
⟩
Next:
#2252
⟨
a
,
b
|
aababba
=
bbb
⟩
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:
bba=c
a
2
bac
⇒
c
b
2
a
⇒
c
b
2
c
⇒
cabac
# ab:aababba=bba ac/b bba=c magic:0 aabac=c bba=c bbc=cabac
Right Cayley graph (truncated)
Left Cayley graph (truncated)
