#16426 ⟨
a
,
b
|
aba
=
ab
,
bbab
=
ab
⟩
Up:
Monoids with two generators and two relations
Prev:
#16424
⟨
a
,
b
|
aba
=
ab
,
bbaa
=
bb
⟩
Next:
#16427
⟨
a
,
b
|
aba
=
ab
,
bbab
=
ba
⟩
Properties
Presentation has sum-of-sides 11
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
) = 0; deg(
a
) = 1
a
b
4
⇒
a
b
2
b
2
ab
⇒
ab
a
2
b
⇒
a
b
3
aba
⇒
ab
a
b
2
a
⇒
a
b
2
a
b
3
a
⇒
a
b
3
# ab:aba=ab,bbab=ab b/a abbbb=abb bbab=ab aab=abbb aba=ab abba=abb abbba=abbb
Right Cayley graph (truncated)
Left Cayley graph (truncated)
