#13195 ⟨
a
,
b
|
abb
=
aab
,
baa
=
ab
⟩
Up:
Monoid enumeration
Prev:
#13194
⟨
a
,
b
|
abb
=
aab
,
baa
=
aa
⟩
Next:
#13196
⟨
a
,
b
|
abb
=
aab
,
baa
=
ba
⟩
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
a
4
=
b
a
4
and
b
⋅
a
4
=
b
a
4
, however
b
a
4
≠
a
4
Not right cancellative, because right multiplication by
a
is not injective:
b
2
a
3
⋅
a
=
b
a
4
and
b
a
3
⋅
a
=
b
a
4
, however
b
2
a
3
≠
b
a
3
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
8
⇒
b
a
6
[5]
2.
ab
⇒
b
a
2
[2]
3.
b
2
a
4
⇒
b
a
4
[4]
# ab:abb=aab,baa=ab a/b - - baaaaaaaa=baaaaaa ab=baa bbaaaa=baaaa