#14593 ⟨
a
,
b
|
aaba
=
a
,
bbbaa
=
a
⟩
Up:
Monoid enumeration
Prev:
#14591
⟨
a
,
b
|
aaba
=
a
,
bbabb
=
a
⟩
Next:
#14596
⟨
a
,
b
|
aaba
=
a
,
bbbab
=
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
⋅
aba
=
a
and
a
⋅ 1 =
a
, however
aba
≠ 1
Not right cancellative, because right multiplication by
a
is not injective:
a
2
b
⋅
a
=
a
and 1 ⋅
a
=
a
, however
a
2
b
≠ 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.
a
2
ba
⇒
a
[1]
2.
ab
a
2
⇒
a
[4]
3.
b
3
a
⇒
aba
[3]
# ab:aaba=a,bbbaa=a ab - - aaba=a abaa=a bbba=aba