#4477 ⟨
a
,
b
|
aaaabbba
=
bba
⟩
Up:
Monoids with two generators and one relation
Prev:
#4476
⟨
a
,
b
|
aaaabbba
=
bab
⟩
Next:
#4478
⟨
a
,
b
|
aaaabbba
=
bbb
⟩
Quick links
Properties
Rewriting system
Properties
Presentation has sum-of-sides 11
Infinite non-commutative monoid
Rewriting system
Format:
Pretty
Plain
Word to reduce:
Tips:
Lowercase letters stand for generators.
Spaces are ignored.
Numbers repeat the previous letter, e.g.
b90
.
Reduction strategy:
Leftmost
Rightmost
Path to normal form:
1
1
Reduction order:
Left-to-right recursive path with deg(
a
) = deg(
c
) = 0,
a
<
c
; deg(
b
) = 1
Auxiliary generators:
bba
=
c
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
4
bc
⇒
c
[4]
2.
b
2
a
⇒
c
[2]
3.
b
2
c
⇒
c
a
3
bc
[5]
# ab:aaaabbba=bba ac/b bba=c magic:0 aaaabc=c bba=c bbc=caaabc