Morphocompletion for #2597 ⟨a, b | ababab=baba⟩

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

Step 1

Checking up to 20 rules for overlaps.

Reduction order:
- Left-to-right recursive path with deg(b) = 0; deg(a) = 1

Rewriting system is not complete: rulesLimit

#	Rule
1.	ababab ⇒ baba
2.	babaab ⇒ abbaba
3.	bbabaaab ⇒ abbbabaa
4.	abaabbaba ⇒ babaaab
5.	babaaabbab ⇒ abaabbbaba
6.	bbabaaaabb ⇒ aabbbbabaa
7.	abaababbaba ⇒ babaaabab
8.	aabbababbabaa ⇒ bbabaaaab
9.	abaaabbbabaa ⇒ babaaabaab
	...

Collecting factors up to length 8 / frequency 7:

[2/0]	ab	34	`lf:26,lp:4,ls:4,rf:20,rp:3,rs:4,lsrp:3,lprs:3`
[2/1]	ba	29	`lf:25,lp:2,ls:2,rf:21,rp:4,rs:3,lsrp:2,lprs:2`
[2/2]	aa	18	`lf:15,lp:1,ls:2,rf:14,rp:1,rs:2,a:1`
[2/3]	bb	13	`lf:10,lp:2,ls:1,rf:9,rp:1,a:1`
[3/0]	aba	21	`lf:15,lp:4,ls:2,rf:12,rp:1,rs:3,lprs:1`
[3/1]	bab	18	`lf:14,lp:2,ls:2,rf:10,rp:4,rs:1,lsrp:1`
[3/2]	baa	11	`lf:9,ls:2,rf:8,rs:2,a:1`
[3/3]	aab	11	`lf:8,lp:1,ls:2,rf:7,rp:1,rs:3,lprs:1,a:1`
[3/4]	bba	10	`lf:8,lp:2,rf:5,rp:1,a:1`
[3/5]	abb	8	`lf:7,ls:1,rf:4,rp:2,a:1`
[3/6]	aaa	5	`lf:5,rf:5,a:2`
[4/0]	abaa	14	`lf:9,lp:3,ls:2,rf:8,rp:1,rs:2,a:1`
[4/1]	baba	14	`lf:10,lp:2,ls:2,rf:9,rp:4,rs:3,re:1,lsrp:2,lprs:2`
[4/2]	bbab	11	`lf:8,lp:2,ls:1,rf:5,rp:1,a:1`
[4/3]	aabb	7	`lf:5,lp:1,ls:1,rf:2,rp:1,lsrp:1,a:2`
[4/4]	abab	6	`lf:4,lp:1,ls:1,rf:1,rs:1`
[4/5]	aaab	5	`lf:4,ls:1,rf:4,rs:2,a:2`
[4/6]	abba	5	`lf:5,rf:1,rp:1,a:1`
[5/0]	bbaba	11	`lf:7,lp:2,ls:2,rf:5,rp:1,rs:2,a:1`
[5/1]	babaa	10	`lf:6,lp:2,ls:2,rf:6,rp:3,rs:2,lsrp:1,a:1`
[5/2]	abaab	6	`lf:3,lp:2,ls:1,rf:2,rp:1,rs:1,a:1`
[5/3]	abbab	6	`lf:5,ls:1,rf:1,rp:1,a:1`
[5/4]	abaaa	5	`lf:4,lp:1,rf:4,a:2`
[5/5]	baaab	4	`lf:3,ls:1,rf:3,rs:1,a:2`
[5/6]	aabba	4	`lf:3,lp:1,a:2`
[6/0]	bbabaa	8	`lf:4,lp:2,ls:2,rf:3,rp:1,rs:2,lsrp:1,lprs:2,a:4`
[6/1]	abbaba	6	`lf:4,ls:2,rf:1,rp:1,rs:1,re:1,a:1`
[6/2]	abaaab	5	`lf:3,lp:1,ls:1,rf:3,rs:1,a:2`
[6/3]	aabbab	5	`lf:3,lp:1,ls:1,a:2`
[6/4]	babaaa	4	`lf:3,lp:1,rf:4,rp:3,a:2`
[6/5]	abaaba	2	`lf:1,lp:1,a:7`
[6/6]	aaaabb	2	`lf:1,ls:1,a:29`
[7/0]	bbabaaa	4	`lf:2,lp:2,rf:1,rp:1,a:4`
[7/1]	babaaab	4	`lf:2,lp:1,ls:1,rf:3,rp:3,rs:1,re:1,a:2`
[7/2]	aabbaba	4	`lf:2,lp:1,ls:1,a:2`
[7/3]	abaaabb	3	`lf:2,lp:1,a:6`
[7/4]	babbaba	3	`lf:2,ls:1,a:5`
[7/5]	baaaabb	2	`lf:1,ls:1,a:29`
[7/6]	abbabaa	2	`lf:1,ls:1,a:5`

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

Step 2

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

Rewriting system is complete. See ⟨a, b | ababab=baba⟩.