#15794 ⟨
a
,
b
|
aab
=
bb
,
bbbaa
=
b
⟩
Up:
Monoid enumeration
Prev:
#15792
⟨
a
,
b
|
aab
=
bb
,
bbabb
=
b
⟩
Next:
#15796
⟨
a
,
b
|
aab
=
bb
,
bbbab
=
b
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 11
Infinite non-cancellative non-commutative monoid
Element
a
has infinite order
Not left cancellative, because left multiplication by
b
is not injective:
b
⋅
b
=
b
a
2
and
b
⋅
a
2
=
b
a
2
, however
b
≠
a
2
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
) = 0; deg(
b
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
b
a
6
⇒
b
[7]
2.
a
2
b
⇒
b
a
2
[6]
3.
b
2
⇒
b
a
2
[8]
# ab:aab=bb,bbbaa=b a/b - - baaaaaa=b aab=baa bb=baa