#3523 ⟨
a
,
b
,
c
|
bb
=
ac
,
baa
=
b
⟩
Up:
Monoid enumeration
Prev:
#3522
⟨
a
,
b
,
c
|
bb
=
ac
,
baa
=
a
⟩
Next:
#3524
⟨
a
,
b
,
c
|
bb
=
ac
,
baa
=
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
⋅
a
2
=
b
and
b
⋅ 1 =
b
, however
a
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 recursive path with deg(
a
) = deg(
b
) = 0,
a
<
b
; deg(
c
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
b
a
2
⇒
b
[2]
2.
ac
⇒
b
2
[1]
3.
bc
⇒
ba
b
2
[3]
# abc:bb=ac,baa=b ab/c - - baa=b ac=bb bc=babb