#1896 ⟨
a
,
b
,
c
|
aba
=
cc
,
bbb
=1⟩
Up:
Monoid enumeration
Prev:
#1893
⟨
a
,
b
,
c
|
aba
=
cc
,
baa
=1⟩
Next:
#1897
⟨
a
,
b
,
c
|
aba
=
cc
,
bbc
=1⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 8
Infinite non-commutative monoid
Element
a
has infinite order
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
<
c
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
aba
⇒
c
2
[1]
2.
b
3
⇒ 1
[2]
3.
c
2
ba
⇒
ab
c
2
[3]
# abc:aba=cc,bbb=1 abc - - aba=cc bbb=1 ccba=abcc