#7193 ⟨
a
,
b
,
c
|
aa
=1,
abcc
=
bc
⟩
Up:
Monoid enumeration
Prev:
#7192
⟨
a
,
b
,
c
|
aa
=1,
abcc
=
bb
⟩
Next:
#7194
⟨
a
,
b
,
c
|
aa
=1,
abcc
=
ca
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 8
Infinite non-cancellative non-commutative monoid
Element
ba
has infinite order
Not right cancellative, because right multiplication by
c
is not injective:
bc
⋅
c
=
abc
and
ab
⋅
c
=
abc
, however
bc
≠
ab
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
⇒ 1
[1]
2.
b
c
2
⇒
abc
[3]
# abc:aa=1,abcc=bc abc - - aa=1 bcc=abc