#24708 ⟨
a
,
b
|
aa
=
a
,
babbab
=
ab
⟩
Up:
Monoid enumeration
Prev:
#24706
⟨
a
,
b
|
aa
=
a
,
bababb
=
bb
⟩
Next:
#24709
⟨
a
,
b
|
aa
=
a
,
babbab
=
bb
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 11
Infinite non-cancellative non-commutative monoid
Element
b
has infinite order
Not left cancellative, because left multiplication by
a
is not injective:
a
⋅
a
=
a
and
a
⋅ 1 =
a
, however
a
≠ 1
Not right cancellative, because right multiplication by
a
is not injective:
a
⋅
a
=
a
and 1 ⋅
a
=
a
, however
a
≠ 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 shortlex with
a
<
b
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
2
⇒
a
[1]
2.
(
ab
)
2
⇒
bab
[4]
3.
a
b
2
ab
⇒
b
2
ab
[9]
4.
b
3
ab
⇒
ab
[10]
# ab:aa=a,babbab=ab ab - - aa=a abab=bab abbab=bbab bbbab=ab