#352 ⟨
a
,
b
,
c
|
aba
=
a
,
caa
=1⟩
Up:
Monoid enumeration
Prev:
#351
⟨
a
,
b
,
c
|
aba
=
a
,
bcc
=1⟩
Next:
#354
⟨
a
,
b
,
c
|
aba
=
a
,
cbc
=1⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 7
Infinite non-cancellative non-commutative monoid
Element
a
has infinite order
Not left cancellative, because left multiplication by
b
is not injective:
b
⋅
ab
=
b
and
b
⋅ 1 =
b
, however
ab
≠ 1
Not right cancellative, because right multiplication by
a
is not injective:
ab
⋅
a
=
a
and 1 ⋅
a
=
a
, however
ab
≠ 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.
ba
⇒ 1
[3]
2.
c
a
2
⇒ 1
[2]
# abc:aba=a,caa=1 abc - - ba=1 caa=1