#12631 ⟨
a
,
b
|
baba
=
ba
,
bbaa
=
a
⟩
Up:
Monoid enumeration
Prev:
#12627
⟨
a
,
b
|
baab
=
bb
,
bbbb
=
b
⟩
Next:
#12633
⟨
a
,
b
|
babb
=
aa
,
bbbb
=
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
⋅
aba
=
ba
and
b
⋅
a
=
ba
, however
aba
≠
a
Not right cancellative, because right multiplication by
a
is not injective:
b
2
a
⋅
a
=
a
and 1 ⋅
a
=
a
, however
b
2
a
≠ 1
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
a
<
b
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
(
ba
)
2
⇒
ba
[1]
2.
b
2
a
2
⇒
a
[2]
# ab:baba=ba,bbaa=a ab - - baba=ba bbaa=a