#15137 ⟨
a
,
b
|
aab
=
ba
,
aaaaaa
=1⟩
Up:
Monoid enumeration
Prev:
#15073
⟨
a
,
b
|
aab
=
ab
,
aaaaaa
=1⟩
Next:
#15158
⟨
a
,
b
|
aab
=
ba
,
ababab
=1⟩
Contents
Properties
Rewriting system
Properties
Sum of relation sides is 11
Infinite non-commutative monoid
Element
b
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:
Right-to-left recursive path with deg(
a
) = 0; deg(
b
) = 1
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
6
⇒ 1
[2]
2.
ba
⇒
a
2
b
[1]
# ab:aab=ba,aaaaaa=1 reversed:a/b - - aaaaaa=1 ba=aab