⟨a, b | abaabba=baa⟩

Up:

Format:	Pretty Plain
Word:
	Enter a word above to compute its normal form. Tips: Lowercase letters stand for generators. Spaces are ignored. Numbers repeat the previous letter, e.g. `b90`.
Strategy:	Leftmost Rightmost
Result:	1 1

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

#	Rule	Proof
1.	acada ⇒ ca²	[8]
2.	acad² ⇒ cad	[9]
3.	bd ⇒ dc	[10]
4.	ba² ⇒ aca	[4]
5.	bad ⇒ acd	[6]
6.	ac² ⇒ d	[3]
7.	acadc ⇒ cac	[18]
8.	bcd ⇒ dadc²	[17]
9.	bca² ⇒ (da)²	[14]
10.	bcad ⇒ dad²	[15]
11.	bac ⇒ d	[7]
12.	dab² ⇒ bc	[11]
13.	acadbc ⇒ cabc	[20]
14.	ca²b² ⇒ acabc	[19]
15.	acab² ⇒ c	[5]
16.	bc² ⇒ dadcab²	[23]
17.	bcac ⇒ dadc	[16]
18.	b²c ⇒ dcab²	[13]
19.	babc ⇒ acbc	[12]
20.	a(ca)²bc ⇒ da²b²	[24]
21.	(bc)² ⇒ dadc²ab²	[21]
22.	bcabc ⇒ dadbc	[22]

# ab:abaabba=baa ad/cb baabb=c,acc=d morph:5/1,3/0 acada=caa acadd=cad bd=dc baa=aca bad=acd acc=d acadc=cac bcd=dadcc bcaa=dada bcad=dadd bac=d dabb=bc acadbc=cabc caabb=acabc acabb=c bcc=dadcabb bcac=dadc bbc=dcabb babc=acbc acacabc=daabb bcbc=dadccabb bcabc=dadbc

Up:	Monoid enumeration
Prev:	#2316 ⟨a, b \| abaabba=abb⟩
Next:	#2318 ⟨a, b \| abaabba=bab⟩

#2317 ⟨a, b | abaabba=baa⟩

Contents

Properties

Rewriting system