#13256 ⟨
a
,
b
|
bab
=
aba
,
bba
=
ab
⟩
Up:
Monoid enumeration
Prev:
#13255
⟨
a
,
b
|
bab
=
aba
,
bba
=
aa
⟩
Next:
#13257
⟨
a
,
b
|
bab
=
aba
,
bba
=
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
2
=
b
3
a
and
b
⋅
b
2
a
=
b
3
a
, however
b
a
2
≠
b
2
a
Not right cancellative, because right multiplication by
a
is not injective:
b
2
a
⋅
a
=
b
3
a
and
b
3
⋅
a
=
b
3
a
, however
b
2
a
≠
b
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:
Right-to-left recursive path with deg(
b
) = 0; deg(
a
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
b
6
a
⇒
b
5
a
[6]
2.
ab
⇒
b
2
a
[2]
3.
b
2
a
2
⇒
b
3
a
[4]
# ab:bab=aba,bba=ab reversed:b/a - - bbbbbba=bbbbba ab=bba bbaa=bbba