#5196 ⟨a, b | aababba=abab⟩

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

#	Rule	Proof
1.	dc ⇒ cd	[7]
2.	c² ⇒ d	[3]
3.	ea ⇒ a³de	[22]
4.	ed ⇒ (ad)²e	[19]
5.	ec ⇒ ade	[18]
6.	ab ⇒ c	[2]
7.	adba ⇒ d	[6]
8.	ad²ba ⇒ db	[14]
9.	d³ba ⇒ ae	[13]
10.	adbd ⇒ d²ba	[9]
11.	d²bd ⇒ a²de	[20]
12.	dbc ⇒ d²ba	[10]
13.	d²bac ⇒ dbd	[12]
14.	eb ⇒ dba²e	[17]
15.	db² ⇒ a²e	[15]
16.	(db)² ⇒ e	[4]
17.	dbd²ba ⇒ ade	[21]

# ab:aababba=abab reversed:adc/eb ab=c,cc=d,dbdb=e morph:2/0,2/0,4/0
dc=cd
cc=d
ea=aaade
ed=adade
ec=ade
ab=c
adba=d
addba=db
dddba=ae
adbd=ddba
ddbd=aade
dbc=ddba
ddbac=dbd
eb=dbaae
dbb=aae
dbdb=e
dbddba=ade