#4631 ⟨a, b | aabaabba=baa⟩

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(a) = deg(d) = 0, a < d; deg(c) = 1; deg(b) = 2
Auxiliary generators:
1. bb=c
2. abaac=d
Certificate: derivations of all rewriting rules from the defining relations.
Morphocompletion: how the auxiliary generators were found.

#	Rule	Proof
1.	(a²d)²da ⇒ da²	[13]
2.	a²da²d³ ⇒ dad	[11]
3.	a²dac ⇒ d	[5]
4.	cd ⇒ ad(da)²c	[14]
5.	ca² ⇒ ad²a	[12]
6.	cad ⇒ ad³	[10]
7.	bd ⇒ a(da)²c	[8]
8.	ba² ⇒ ada	[4]
9.	bad ⇒ ad²	[9]
10.	bc ⇒ cb	[6]
11.	b² ⇒ c	[2]

# ab:aabaabba=baa reversed:ad/c/b bb=c,abaac=d morph:2/1,5/1
aadaadda=daa
aadaaddd=dad
aadac=d
cd=addadac
caa=adda
cad=addd
bd=adadac
baa=ada
bad=add
bc=cb
bb=c