#24674 ⟨
a
,
b
|
aa
=
a
,
abbabb
=
ab
⟩
Up:
Monoids with two generators and two relations
Prev:
#24667
⟨
a
,
b
|
aa
=
a
,
ababbb
=
ba
⟩
Next:
#24675
⟨
a
,
b
|
aa
=
a
,
abbabb
=
ba
⟩
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 shortlex with
b
<
a
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
2
⇒
a
[1]
2.
aba
b
2
⇒
a
b
2
ab
[3]
3.
(
a
b
2
)
2
⇒
ab
[2]
# ab:aa=a,abbabb=ab ba aa=a ababb=abbab abbabb=ab