#476 ⟨
a
,
b
|
ababba
=
ab
⟩
Up:
Monoid enumeration
Prev:
#475
⟨
a
,
b
|
ababba
=
aa
⟩
Next:
#477
⟨
a
,
b
|
ababba
=
ba
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 8
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 recursive path with deg(
a
) = deg(
c
) = 0,
a
<
c
; deg(
b
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
Morphocompletion
: how the auxiliary generators were found.
#
Rule
Proof
1.
c
2
a
⇒
c
[5]
2.
abca
⇒
ab
[3]
3.
cb
⇒
ab
c
2
[4]
4.
a
b
2
⇒
c
[2]
# ab:ababba=ab ac/b abb=c morph:3/0 cca=c abca=ab cb=abcc abb=c