#4881 ⟨a, b | abbbaaab=aba⟩

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:
- Right-to-left recursive path with deg(b) = deg(c) = 0, b < c; deg(a) = 1
Auxiliary generators:
1. aab=c
Certificate: derivations of all rewriting rules from the defining relations.
Morphocompletion: how the auxiliary generators were found.

#	Rule	Proof
1.	cb²ac ⇒ ca	[4]
2.	c²bacb ⇒ cac	[11]
3.	a²b ⇒ c	[2]
4.	ca²c ⇒ c²bacab	[12]
5.	cab²ac ⇒ ca²	[6]
6.	cacbac ⇒ c²baca	[10]
7.	ab³ac ⇒ aba	[3]
8.	abcbacb ⇒ abac	[14]
9.	ca³ ⇒ c²bac	[8]
10.	aba²c ⇒ abcbacab	[13]
11.	abab²ac ⇒ aba²	[5]
12.	a(bac)² ⇒ abcbaca	[9]
13.	aba³ ⇒ abcbac	[7]

# ab:abbbaaab=aba reversed:bc/a aab=c morph:3/1
cbbac=ca
ccbacb=cac
aab=c
caac=ccbacab
cabbac=caa
cacbac=ccbaca
abbbac=aba
abcbacb=abac
caaa=ccbac
abaac=abcbacab
ababbac=abaa
abacbac=abcbaca
abaaa=abcbac