#12611 ⟨
a
,
b
|
abbb
=
ba
,
bbbb
=
b
⟩
Up:
Monoid enumeration
Prev:
#12609
⟨
a
,
b
|
abbb
=
ab
,
bbbb
=
b
⟩
Next:
#12614
⟨
a
,
b
|
baab
=
aa
,
babb
=
a
⟩
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
3
=
b
and
b
⋅ 1 =
b
, however
b
3
≠ 1
Not right cancellative, because right multiplication by
b
is not injective:
b
3
⋅
b
=
b
and 1 ⋅
b
=
b
, however
b
3
≠ 1
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:
Left-to-right recursive path with deg(
b
) = 0; deg(
a
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
b
4
⇒
b
[2]
2.
ba
⇒
a
b
3
[1]
# ab:abbb=ba,bbbb=b b/a - - bbbb=b ba=abbb