#5081 ⟨
a
,
b
|
aaabbaa
=
bbaa
⟩
Up:
Monoid enumeration
Prev:
#5080
⟨
a
,
b
|
aaabbaa
=
babb
⟩
Next:
#5082
⟨
a
,
b
|
aaabbaa
=
bbab
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 11
Infinite non-cancellative non-commutative monoid
Element
a
has infinite order
Not right cancellative, because right multiplication by
c
is not injective:
a
3
⋅
c
=
c
and 1 ⋅
c
=
c
, however
a
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
Auxiliary generators:
c
=
bbaa
Reduction order:
Left-to-right shortlex with
a
<
c
<
b
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
b
2
c
⇒
cac
[5]
2.
a
3
c
⇒
c
[4]
3.
b
2
a
2
⇒
c
[2]
4.
b
2
ac
⇒
c
a
2
c
[6]
# ab:aaabbaa=bbaa acb bbaa=c magic:0 bbc=cac aaac=c bbaa=c bbac=caac