#290 ⟨
a
,
b
,
c
|
aab
=
a
,
bcc
=1⟩
Up:
Monoid enumeration
Prev:
#289
⟨
a
,
b
,
c
|
aab
=
a
,
bcb
=1⟩
Next:
#292
⟨
a
,
b
,
c
|
aab
=
a
,
cab
=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
a
is not injective:
a
⋅
ab
=
a
and
a
⋅ 1 =
a
, however
ab
≠ 1
Not right cancellative, because right multiplication by
c
2
is not injective:
c
2
b
⋅
c
2
=
c
2
and 1 ⋅
c
2
=
c
2
, however
c
2
b
≠ 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.
a
2
b
⇒
a
[1]
2.
a
c
2
⇒
a
2
[3]
3.
b
c
2
⇒ 1
[2]
# abc:aab=a,bcc=1 abc - - aab=a acc=aa bcc=1