#16467 ⟨
a
,
b
|
aba
=
bb
,
babb
=
ab
⟩
Up:
Monoid enumeration
Prev:
#16465
⟨
a
,
b
|
aba
=
bb
,
baab
=
bb
⟩
Next:
#16470
⟨
a
,
b
|
aba
=
bb
,
bbbb
=
aa
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 11
Infinite non-cancellative non-commutative monoid
Element
a
has infinite order
Not left cancellative, because left multiplication by
b
is not injective:
b
⋅
b
7
=
b
2
and
b
⋅
b
=
b
2
, however
b
7
≠
b
Not right cancellative, because right multiplication by
b
is not injective:
b
7
⋅
b
=
b
2
and
b
⋅
b
=
b
2
, however
b
7
≠
b
Rewriting system
Format:
Pretty
Plain
Word:
Enter a word above to compute its normal form. Tips:
Lowercase letters stand for generators.
Spaces are ignored.
Numbers repeat the previous letter, e.g.
b90
.
Strategy:
Leftmost
Rightmost
Result:
1
1
Reduction order:
Right-to-left recursive path with deg(
b
) = 0; deg(
a
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
b
8
⇒
b
2
[11]
2.
ab
⇒
b
5
a
[10]
3.
b
2
a
2
⇒
b
5
[12]
# ab:aba=bb,babb=ab reversed:b/a - - bbbbbbbb=bb ab=bbbbba bbaa=bbbbb