#12960 ⟨
a
,
b
|
aba
=
aab
,
bbba
=
a
⟩
Up:
Monoid enumeration
Prev:
#12959
⟨
a
,
b
|
aba
=
aab
,
bbab
=
b
⟩
Next:
#12963
⟨
a
,
b
|
aba
=
aab
,
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
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:
b
3
⋅
a
=
a
and 1 ⋅
a
=
a
, however
b
3
≠ 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
b
<
a
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
2
b
⇒
aba
[1]
2.
b
3
a
⇒
a
[2]
3.
aba
b
2
a
⇒
a
3
[3]
4.
a
(
ba
)
3
⇒
a
4
[4]
# ab:aba=aab,bbba=a ba - - aab=aba bbba=a ababba=aaa abababa=aaaa