#6906 ⟨
a
,
b
,
c
|
ab
=1,
acaac
=
c
⟩
Up:
Monoid enumeration
Prev:
#6904
⟨
a
,
b
,
c
|
ab
=1,
acaac
=
a
⟩
Next:
#6915
⟨
a
,
b
,
c
|
ab
=1,
acaca
=
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
a
is not injective:
a
⋅
ba
=
a
and
a
⋅ 1 =
a
, however
ba
≠ 1
Not right cancellative, because right multiplication by
b
is not injective:
ba
⋅
b
=
b
and 1 ⋅
b
=
b
, however
ba
≠ 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
⇒ 1
[1]
2.
cac
⇒
a
c
2
[4]
3.
c
a
2
c
⇒
a
2
c
2
[6]
4.
a
3
c
2
⇒
c
[5]
# abc:ab=1,acaac=c abc - - ab=1 cac=acc caac=aacc aaacc=c