#4287 ⟨
a
,
b
,
c
|
aab
=1,
caaa
=
c
⟩
Up:
Monoid enumeration
Prev:
#4284
⟨
a
,
b
,
c
|
aab
=1,
bccc
=
c
⟩
Next:
#4291
⟨
a
,
b
,
c
|
aab
=1,
caac
=
a
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 8
Infinite non-cancellative non-commutative monoid
Element
a
has infinite order
Not left cancellative, because left multiplication by
c
is not injective:
c
⋅
b
=
ca
and
c
⋅
a
=
ca
, however
b
≠
a
Not right cancellative, because right multiplication by
ab
is not injective:
aba
⋅
ab
=
ab
and 1 ⋅
ab
=
ab
, however
aba
≠ 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.
cb
⇒
ca
[3]
2.
a
2
b
⇒ 1
[1]
3.
cab
⇒
c
a
2
[4]
4.
c
a
3
⇒
c
[2]
# abc:aab=1,caaa=c abc - - cb=ca aab=1 cab=caa caaa=c