#14591 ⟨a, b | aaba=a, bbabb=a⟩

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

Auxiliary generators:
1. c = bb
2. d = abab
Reduction order:
- Right-to-left recursive path with deg(d) = 0; deg(a) = deg(c) = deg(b) = 1, a < c < b
Certificate: derivations of all rewriting rules from the defining relations.
Morphocompletion: how the auxiliary generators were found.

#	Rule	Proof
1.	ad² ⇒ dad	[11]
2.	cd ⇒ dc	[23]
3.	dbd ⇒ dc	[21]
4.	(ad)² ⇒ d	[12]
5.	ab ⇒ ad	[9]
6.	adb ⇒ ac	[13]
7.	cb ⇒ bc	[6]
8.	b² ⇒ c	[3]
9.	a²da ⇒ a	[15]
10.	cada ⇒ db	[20]
11.	dbada ⇒ db	[22]
12.	a²c ⇒ ca²	[7]
13.	adac ⇒ db	[10]
14.	a²dc ⇒ ca²d	[14]
15.	cac ⇒ a	[5]
16.	cadc ⇒ ad	[17]
17.	dbac ⇒ ada²	[18]
18.	dbadc ⇒ ada²d	[19]

# ab:aaba=a,bbabb=a reversed:d/acb bb=c,abab=d morph:2/0,4/0
add=dad
cd=dc
dbd=dc
adad=d
ab=ad
adb=ac
cb=bc
bb=c
aada=a
cada=db
dbada=db
aac=caa
adac=db
aadc=caad
cac=a
cadc=ad
dbac=adaa
dbadc=adaad