#112 ⟨
a
,
b
|
abba
=
ab
⟩
Up:
Monoid enumeration
Prev:
#111
⟨
a
,
b
|
abba
=
aa
⟩
Next:
#113
⟨
a
,
b
|
abba
=
bb
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 6
Infinite non-cancellative non-commutative monoid
Element
a
has infinite order
Not left cancellative, because left multiplication by
c
is not injective:
c
⋅
ca
=
c
and
c
⋅ 1 =
c
, however
ca
≠ 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
=
abb
Reduction order:
Left-to-right shortlex with
c
<
b
<
a
Certificate
: derivations of all rewriting rules from the defining relations.
Morphocompletion
: how the auxiliary generators were found.
#
Rule
Proof
1.
cb
⇒
c
2
[5]
2.
ab
⇒
ca
[3]
3.
c
2
a
⇒
c
[4]
# ab:abba=ab cba abb=c morph:3/1 cb=cc ab=ca cca=c