#4795 ⟨a, b | abaababa=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. aba=c
2. ccb=d
Certificate: derivations of all rewriting rules from the defining relations.
Morphocompletion: how the auxiliary generators were found.

#	Rule	Proof
1.	adad²a ⇒ da²	[12]
2.	adad³ ⇒ dad	[13]
3.	adad²c ⇒ dac	[15]
4.	ca ⇒ ada	[6]
5.	cd ⇒ ad²	[11]
6.	c² ⇒ adc	[8]
7.	adcb ⇒ d	[9]
8.	aba ⇒ c	[2]
9.	bd ⇒ d²cb	[14]
10.	ba² ⇒ da	[4]
11.	bad ⇒ d²	[10]
12.	abc ⇒ cba	[5]
13.	bac ⇒ dc	[7]

# ab:abaababa=baa reversed:ad/c/b aba=c,ccb=d morph:3/0,3/0
adadda=daa
adaddd=dad
adaddc=dac
ca=ada
cd=add
cc=adc
adcb=d
aba=c
bd=ddcb
baa=da
bad=dd
abc=cba
bac=dc