#13257 ⟨
a
,
b
|
bab
=
aba
,
bba
=
ba
⟩
Up:
Monoid enumeration
Prev:
#13256
⟨
a
,
b
|
bab
=
aba
,
bba
=
ab
⟩
Next:
#13258
⟨
a
,
b
|
bab
=
aba
,
bba
=
bb
⟩
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
⋅
ba
=
ba
and
b
⋅
a
=
ba
, however
ba
≠
a
Not right cancellative, because right multiplication by
a
is not injective:
b
2
⋅
a
=
ba
and
b
⋅
a
=
ba
, however
b
2
≠
b
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.
b
2
a
⇒
ba
[2]
2.
aba
⇒
bab
[1]
3.
ba
b
2
⇒
bab
[3]
# ab:bab=aba,bba=ba ba - - bba=ba aba=bab babb=bab