#6744 ⟨
a
,
b
,
c
|
aa
=1,
bbacb
=
c
⟩
Up:
Monoid enumeration
Prev:
#6743
⟨
a
,
b
,
c
|
aa
=1,
bbacb
=
b
⟩
Next:
#6746
⟨
a
,
b
,
c
|
aa
=1,
bbacc
=
b
⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 8
Infinite non-commutative monoid
Element
ba
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
<
c
<
b
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
2
⇒ 1
[1]
2.
b
2
a
c
2
⇒
cbacb
[3]
3.
b
2
acb
⇒
c
[2]
# abc:aa=1,bbacb=c acb - - aa=1 bbacc=cbacb bbacb=c