#21739 ⟨a, b | aaa=1, abbabba=b⟩
Quick links
- Properties
- Rewriting system
- Presentation has sum-of-sides 11
- Infinite non-commutative monoid
- Auxiliary generators:
- c = bbaba
- d = abacc
- Reduction order:
- Left-to-right recursive path with deg(b) = deg(d) = 0, b < d; deg(c) = 1; deg(a) = 2
- Certificate: derivations of all rewriting rules from the defining relations.
- Morphocompletion: how the auxiliary generators were found.
# ab:aaa=1,abbabba=b bd/c/a bbaba=c,abacc=d morph:5/0,5/0
db=bd
bbbd=b
bbdd=d
cbbd=c
dc=bcbdd
bbbc=cbbb
bcbc=ccbbbbbbbbbbbbbb
bbcc=cbcbdddddd
ccc=bbd
babbd=ba
da=babdd
bbba=abbb
ca=bacbbbbb
cba=bbabbcbdd
cbba=abcbddd
aab=baccbbb
aad=bacc
aac=baccbbc
aba=bcbdd
abba=bbacc
baa=bbaccbb
aaa=1