#16189 ⟨
a
,
b
|
aab
=
ab
,
babb
=
aa
⟩
Up:
Monoids with two generators and two relations
Prev:
#16188
⟨
a
,
b
|
aab
=
ab
,
baba
=
bb
⟩
Next:
#16190
⟨
a
,
b
|
aab
=
ab
,
babb
=
ab
⟩
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:
Right-to-left recursive path with deg(
b
) = 0; deg(
a
) = 1
b
3
ab
⇒
ab
a
b
3
⇒
b
2
ab
a
2
⇒
ba
b
2
a
b
2
a
⇒
a
b
2
(
ab
)
2
⇒
bab
# ab:aab=ab,babb=aa reversed:b/a bbbab=ab abbb=bbab aa=babb abba=abb abab=bab
Right Cayley graph (truncated)
Left Cayley graph (truncated)
