#6695 ⟨
a
,
b
,
c
|
aa
=1,
abccc
=
c
⟩
Up:
Monoid enumeration
Prev:
#6694
⟨
a
,
b
,
c
|
aa
=1,
abccc
=
b
⟩
Next:
#6711
⟨
a
,
b
,
c
|
aa
=1,
babac
=
b
⟩
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:
b
c
2
⋅
c
=
ac
and
a
⋅
c
=
ac
, however
b
c
2
≠
a
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
3
⇒
ac
[3]
# abc:aa=1,abccc=c abc - - aa=1 bccc=ac