#2804 ⟨
a
,
b
,
c
|
aaa
=
a
,
abc
=
b
⟩
Up:
Monoid enumeration
Prev:
#2803
⟨
a
,
b
,
c
|
aaa
=
a
,
abc
=
a
⟩
Next:
#2805
⟨
a
,
b
,
c
|
aaa
=
a
,
abc
=
c
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 8
Infinite non-cancellative non-commutative monoid
Element
a
2
c
has infinite order
Not left cancellative, because left multiplication by
a
is not injective:
a
⋅
a
2
=
a
and
a
⋅ 1 =
a
, however
a
2
≠ 1
Not right cancellative, because right multiplication by
a
is not injective:
a
2
⋅
a
=
a
and 1 ⋅
a
=
a
, however
a
2
≠ 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
<
c
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
bc
⇒
ab
[4]
2.
a
3
⇒
a
[1]
3.
a
2
b
⇒
b
[3]
# abc:aaa=a,abc=b abc - - bc=ab aaa=a aab=b