#5422 ⟨
a
,
b
,
c
|
ab
=
a
,
caca
=
a
⟩
Up:
Monoid enumeration
Prev:
#5412
⟨
a
,
b
,
c
|
ab
=
a
,
caac
=
c
⟩
Next:
#5424
⟨
a
,
b
,
c
|
ab
=
a
,
caca
=
c
⟩
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
a
is not injective:
a
⋅
b
=
a
and
a
⋅ 1 =
a
, however
b
≠ 1
Not right cancellative, because right multiplication by
a
is not injective:
cac
⋅
a
=
a
and 1 ⋅
a
=
a
, however
cac
≠ 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.
ab
⇒
a
[1]
2.
c
a
2
⇒
aca
[3]
3.
(
ca
)
2
⇒
a
[2]
# abc:ab=a,caca=a abc - - ab=a caa=aca caca=a