#350 ⟨
a
,
b
,
c
|
aba
=
a
,
bcb
=1⟩
Up:
Monoid enumeration
Prev:
#349
⟨
a
,
b
,
c
|
aba
=
a
,
bbc
=1⟩
Next:
#351
⟨
a
,
b
,
c
|
aba
=
a
,
bcc
=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
⋅
ba
=
a
and
a
⋅ 1 =
a
, however
ba
≠ 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.
cb
⇒
bc
[3]
2.
aba
⇒
a
[1]
3.
b
2
c
⇒ 1
[4]
# abc:aba=a,bcb=1 abc - - cb=bc aba=a bbc=1