#13166 ⟨
a
,
b
|
aba
=
aab
,
bab
=
aa
⟩
Up:
Monoid enumeration
Prev:
#13165
⟨
a
,
b
|
aba
=
aab
,
baa
=
bb
⟩
Next:
#13167
⟨
a
,
b
|
aba
=
aab
,
bab
=
ab
⟩
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
a
is not injective:
a
⋅
ab
=
aba
and
a
⋅
ba
=
aba
, however
ab
≠
ba
Not right cancellative, because right multiplication by
a
is not injective:
aba
⋅
a
=
b
a
3
and
b
a
2
⋅
a
=
b
a
3
, however
aba
≠
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 shortlex with
b
<
a
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
bab
⇒
a
2
[2]
2.
a
2
b
⇒
aba
[1]
3.
ab
a
2
⇒
b
a
3
[3]
4.
b
2
a
3
⇒
a
4
[4]
# ab:aba=aab,bab=aa ba - - bab=aa aab=aba abaa=baaa bbaaa=aaaa