#2505 ⟨
a
,
b
|
aababa
=
baba
⟩
Up:
Monoid enumeration
Prev:
#2504
⟨
a
,
b
|
aababa
=
baab
⟩
Next:
#2506
⟨
a
,
b
|
aababa
=
babb
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 10
Infinite non-cancellative non-commutative monoid
Element
a
has infinite order
Not right cancellative, because right multiplication by
c
is not injective:
a
2
⋅
c
=
c
and 1 ⋅
c
=
c
, 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
Auxiliary generators:
c
=
baba
Reduction order:
Left-to-right shortlex with
a
<
c
<
b
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
2
c
⇒
c
[4]
2.
bac
⇒
cba
[5]
3.
(
ba
)
2
⇒
c
[2]
4.
babc
⇒
cac
[6]
# ab:aababa=baba acb baba=c magic:0 aac=c bac=cba baba=c babc=cac