#1669 ⟨
a
,
b
|
aba
=
ab
,
baa
=
b
⟩
Up:
Monoid enumeration
Prev:
#1665
⟨
a
,
b
|
aba
=
aa
,
bbb
=
b
⟩
Next:
#1671
⟨
a
,
b
|
aba
=
ab
,
bab
=
b
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 9
Infinite non-cancellative non-commutative monoid
Element
a
has infinite order
Not left cancellative, because left multiplication by
b
is not injective:
b
⋅
a
2
=
b
and
b
⋅ 1 =
b
, however
a
2
≠ 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.
aba
⇒
ab
[1]
2.
b
a
2
⇒
b
[2]
3.
b
2
a
⇒
b
2
[3]
# ab:aba=ab,baa=b ab - - aba=ab baa=b bba=bb