#1978 ⟨a, b | aababbba=ab⟩
Quick links
- Properties
- Rewriting system
- Presentation has sum-of-sides 10
- Infinite non-cancellative non-commutative monoid
- Not left cancellative, because left multiplication by a is not injective:
-
a ⋅ abab3a = ab and a ⋅ b = ab, however abab3a ≠ b
- Enveloping group: ⟨a, b | aabbab-1b-1⟩
- Auxiliary generators:
- c = abbb
- Reduction order:
- Left-to-right shortlex with a < b < c
- Certificate: derivations of all rewriting rules from the defining relations.
- Morphocompletion: how the auxiliary generators were found.
# ab:aababbba=ab abc abbb=c morph:4/0
abbb=c
aabca=ab
aabcc=cb
abbca=aabcb
cabca=cb
cbbbb=cabcc
cbbca=cabcb
ababca=abb
ababcb=cca
ababcc=cbb
cbabca=cbb
cbabcc=cabccb
cbbbca=cbabcb
abbabca=c
abbabcb=cbca
abbabcc=cbbb
cbbabca=cbbb
cbbabcb=cabccca
cbbabcc=cabccbb
cbbbabca=cabcc
cbbbabcb=cabccbca
cbbbabcc=cabccbbb