⟨a, b | ababbba=baab⟩

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 = bba
2. d = ababc
Reduction order:
- Left-to-right recursive path with deg(c) = 0; deg(d) = deg(a) = deg(b) = 1, d < a < b
Certificate: derivations of all rewriting rules from the defining relations.
Morphocompletion: how the auxiliary generators were found.

#	Rule	Proof
1.	bd ⇒ cab	[5]
2.	bad ⇒ dabc	[9]
3.	ba²c ⇒ dba	[6]
4.	cbabc ⇒ bcab	[8]
5.	b²a ⇒ c	[2]
6.	(ab)²c ⇒ d	[3]
7.	ba²d ⇒ da²b	[7]
8.	ba²b ⇒ d	[4]
9.	cbab²cd ⇒ bcacbcabc	[16]
10.	cbab²cac ⇒ bca(cb)²a	[15]
11.	abab²cd ⇒ db(abc)²	[13]
12.	abab²cac ⇒ dbabcba	[12]
13.	cbab²cad ⇒ bcacbca²b	[17]
14.	cbab²cab ⇒ bcacbc	[11]
15.	abab²cad ⇒ dbabca²b	[14]
16.	abab²cab ⇒ dbabc	[10]

# ab:ababbba=baab c/dab bba=c,ababc=d morph:3/0,5/0 bd=cab bad=dabc baac=dba cbabc=bcab bba=c ababc=d baad=daab baab=d cbabbcd=bcacbcabc cbabbcac=bcacbcba ababbcd=dbabcabc ababbcac=dbabcba cbabbcad=bcacbcaab cbabbcab=bcacbc ababbcad=dbabcaab ababbcab=dbabc

Up:	Monoid enumeration
Prev:	#5373 ⟨a, b \| ababbba=baaa⟩
Next:	#5375 ⟨a, b \| ababbba=baba⟩

#5374 ⟨a, b | ababbba=baab⟩

Contents

Properties

Rewriting system