#3343 ⟨
a
,
b
,
c
|
ab
=
aa
,
bcc
=
b
⟩
Up:
Monoid enumeration
Prev:
#3342
⟨
a
,
b
,
c
|
ab
=
aa
,
bcc
=
a
⟩
Next:
#3344
⟨
a
,
b
,
c
|
ab
=
aa
,
bcc
=
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
b
is not injective:
b
⋅
c
2
=
b
and
b
⋅ 1 =
b
, however
c
2
≠ 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
2
[1]
2.
b
c
2
⇒
b
[2]
3.
a
2
c
2
⇒
a
2
[3]
# abc:ab=aa,bcc=b abc - - ab=aa bcc=b aacc=aa