Morphocompletion for #2057 ⟨a, b | abababba=ab⟩

Solved by morph:2/0,2/0. (See Morphocompletion.)

Step 1

Checking up to 20 rules for overlaps.

Rewriting system is not complete: rulesLimit

Collecting factors up to length 7, frequency 4:

Considering [length 2 / frequency 0] ab=c.

Checking up to 20 rules for overlaps.

Auxiliary generators:
1. c = ab
Reduction order:
- Right-to-left recursive path with deg(a) = deg(c) = 0, a < c; deg(b) = 1

Rewriting system is not complete: wordLimit

#	Rule
1.	ab ⇒ c
2.	cccba ⇒ c
3.	cccbc ⇒ cb
4.	cbba ⇒ cccccb
5.	cbcba ⇒ cccb
6.	cbccba ⇒ cb
7.	cbbc ⇒ cccccbb
8.	cbcbc ⇒ cccbb
9.	cbccbc ⇒ cbb
10.	cbbba ⇒ cbccccb
11.	cbbbc ⇒ cbccccbb
12.	cbbbba ⇒ cccccccccccccccccbbb
13.	cbbbbc ⇒ cccccccccccccccccbbbb
	...

Collecting factors up to length 6, frequency 7:

Length 2:	[2/0] cb, [2/1] bc, [2/2] bb, [2/3] ba, [2/4] cc
Length 3:	[3/0] cbc, [3/1] cbb, [3/2] bbb, [3/3] bbc, [3/4] bba, [3/5] cba, [3/6] ccb
Length 4:	[4/0] cbbb, [4/1] bbbc, [4/2] bbba, [4/3] cbcb, [4/4] cbcc, [4/5] ccbc, [4/6] ccba
Length 5:	[5/0] cbbbb, [5/1] cbccb, [5/2] bbbbc, [5/3] bbbba, [5/4] bccbc, [5/5] bccba, [5/6] ccbbb

Considering [length 2 / frequency 0] cb=d.

Auxiliary generators:
1. c = ab
2. d = cb
Reduction order:
- Right-to-left recursive path with deg(a) = deg(c) = 0, a < c; deg(d) = deg(b) = 1, d < b

Rewriting system is complete. See ⟨a, b | abababba=ab⟩.