#7823 ⟨
a
,
b
|
aaa
=1,
bbbbb
=
bb
⟩
Up:
Monoids with two generators and two relations
Prev:
#7820
⟨
a
,
b
|
aaa
=1,
bbabb
=
bb
⟩
Next:
#7871
⟨
a
,
b
|
aab
=1,
ababb
=
bb
⟩
Quick links
Properties
Rewriting system
Properties
Presentation has sum-of-sides 10
Isomorphic to ℤ
3
∗ ℕ
(5 = 2)
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
a
<
b
Certificate
: derivations of all rewriting rules from the defining relations.
#
Rule
Proof
1.
a
3
⇒ 1
[1]
2.
b
5
⇒
b
2
[2]
# ab:aaa=1,bbbbb=bb ab aaa=1 bbbbb=bb