#13235 ⟨
a
,
b
|
baa
=
abb
,
bab
=
bb
⟩
Up:
Monoid enumeration
Prev:
#13234
⟨
a
,
b
|
baa
=
abb
,
bab
=
ba
⟩
Next:
#13236
⟨
a
,
b
|
baa
=
abb
,
bba
=
aa
⟩
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
⋅
ab
=
b
2
and
b
⋅
b
=
b
2
, however
ab
≠
b
Not right cancellative, because right multiplication by
b
is not injective:
ba
⋅
b
=
b
2
and
b
⋅
b
=
b
2
, however
ba
≠
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
a
<
b
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
b
a
2
⇒
a
b
2
[1]
2.
bab
⇒
b
2
[2]
3.
a
b
3
⇒
b
3
[6]
4.
b
4
⇒
b
3
[5]
# ab:baa=abb,bab=bb ab - - baa=abb bab=bb abbb=bbb bbbb=bbb