#1807 ⟨a, b | abbabaaab=a⟩
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 ⋅ b2aba3b = a and a ⋅ 1 = a, however b2aba3b ≠ 1
- Enveloping group: ⟨a, b | aaababbb⟩
- Auxiliary generators:
- c = ab
- d = ac
- e = bcada
- Reduction order:
- Right-to-left recursive path with deg(b) = deg(d) = 0, b < d; deg(c) = 1; deg(e) = deg(a) = 2, e < a
- Certificate: derivations of all rewriting rules from the defining relations.
- Morphocompletion: how the auxiliary generators were found.
# ab:abbabaaab=a reversed:bd/c/ea ab=c,ac=d,bcada=e morph:2/1,2/0,5/1
ddeb=ccde
ceb=d
dcdeb=dbcde
dbcdeb=ce
ccdeb=cbcde
ed=bcdcde
cbcdebb=c
cbcdebd=deb
ec=bcdebd
bcdebc=eb
a=cbcdeb
eeb=ebbccbcdcde
ebeb=bcdebd
ebdeb=bcdebbcde
ebcdeb=ebbcde
ebbcdeb=e