#7693 ⟨
a
,
b
,
c
|
aa
=1,
bcc
=
bab
⟩
Up:
Monoid enumeration
Prev:
#7689
⟨
a
,
b
,
c
|
aa
=1,
bcb
=
bbc
⟩
Next:
#7694
⟨
a
,
b
,
c
|
aa
=1,
bcc
=
bbb
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 8
Infinite non-cancellative non-commutative monoid
Element
ba
has infinite order
Not left cancellative, because left multiplication by
b
is not injective:
b
⋅
c
2
=
bab
and
b
⋅
ab
=
bab
, however
c
2
≠
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
⇒
bab
[2]
# abc:aa=1,bcc=bab abc - - aa=1 bcc=bab