#16379 ⟨
a
,
b
|
aba
=
ab
,
aaab
=
ba
⟩
Up:
Monoid enumeration
Prev:
#16378
⟨
a
,
b
|
aba
=
ab
,
aaab
=
ab
⟩
Next:
#16380
⟨
a
,
b
|
aba
=
ab
,
aaab
=
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
a
is not injective:
a
⋅
a
3
b
=
ab
and
a
⋅
b
=
ab
, however
a
3
b
≠
b
Not right cancellative, because right multiplication by
b
is not injective:
a
4
⋅
b
=
ab
and
a
⋅
b
=
ab
, however
a
4
≠
a
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(
a
) = 0; deg(
b
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
4
b
⇒
ab
[3]
2.
ba
⇒
a
3
b
[2]
# ab:aba=ab,aaab=ba reversed:a/b - - aaaab=ab ba=aaab