Morphocompletion for #5228 ⟨a, b | aabbaba=abab⟩

Solved by morph:4/4. (See Morphocompletion.)

Step 1

Checking up to 20 rules for overlaps.

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

Rewriting system is not complete: rulesLimit

#	Rule
1.	aabbaba ⇒ abab
2.	abababbaba ⇒ ababbab
3.	ababbabbaba ⇒ ababbbab
4.	ababbbabbaba ⇒ ababbbbab
5.	ababbababbaba ⇒ ababbabbab
6.	abababbabbab ⇒ ababbabbbaba
7.	ababbbbabbaba ⇒ ababbbbbab
	...

Collecting factors up to length 8 / frequency 7:

[2/0]	ab	35	`lf:28,lp:6,ls:1,rf:22,rp:7,rs:6,lprp:6,lsrp:1,lprs:5`
[2/1]	ba	33	`lf:27,ls:6,rf:16,rs:1`
[2/2]	bb	15	`lf:15,rf:15`
[2/3]	aa	2	`lf:1,lp:1`
[3/0]	aba	27	`lf:15,lp:6,ls:6,rf:8,rp:7,rs:1,lprp:6,lsrp:6,lprs:1`
[3/1]	bab	22	`lf:21,ls:1,rf:15,rs:6`
[3/2]	abb	12	`lf:12,rf:8`
[3/3]	bba	12	`lf:12,rf:8`
[3/4]	bbb	3	`lf:3,rf:7,a:2`
[3/5]	aab	2	`lf:1,lp:1`
[4/0]	abab	15	`lf:9,lp:6,rf:7,rp:7,rs:1,re:1,lprp:6`
[4/1]	baba	15	`lf:9,ls:6,rf:1,rs:1`
[4/2]	bbab	13	`lf:12,ls:1,rf:8,rs:5`
[4/3]	babb	11	`lf:11,rf:8,a:1`
[4/4]	abba	10	`lf:10,rf:4`
[4/5]	abbb	2	`lf:2,rf:4,a:2`
[4/6]	bbba	2	`lf:2,rf:4,a:2`
[5/0]	bbaba	13	`lf:7,ls:6,rf:1,rs:1`
[5/1]	ababb	11	`lf:7,lp:4,rf:6,rp:6,lprp:4,a:1`
[5/2]	abbab	11	`lf:10,ls:1,rf:4,rs:2`
[5/3]	babba	9	`lf:9,rf:4,a:1`
[5/4]	bbabb	4	`lf:4,rf:2,a:2`
[5/5]	ababa	4	`lf:2,lp:2,a:1`
[5/6]	babab	3	`lf:3,a:1`
[6/0]	abbaba	13	`lf:7,ls:6`
[6/1]	babbab	10	`lf:9,ls:1,rf:4,rs:2,a:1`
[6/2]	ababba	7	`lf:5,lp:2,rf:3,rp:3,lprp:1,a:1`
[6/3]	ababbb	4	`lf:2,lp:2,rf:3,rp:3,lprp:2,a:2`
[6/4]	bbabba	4	`lf:4,rf:1,a:2`
[6/5]	ababab	4	`lf:2,lp:2,a:1`
[6/6]	bababb	3	`lf:3,a:1`
[7/0]	babbaba	11	`lf:6,ls:5,a:1`
[7/1]	ababbab	7	`lf:5,lp:2,rf:3,rp:3,rs:1,re:1,lprp:1,a:1`
[7/2]	bbabbab	5	`lf:4,ls:1,rf:1,rs:1,a:2`
[7/3]	abababb	4	`lf:2,lp:2,a:1`
[7/4]	bababba	3	`lf:3,a:1`
[7/5]	ababbbb	2	`lf:1,lp:1,rf:2,rp:2,lprp:1,a:6`
[7/6]	babbabb	2	`lf:2,rf:2,a:2`

Considering [length 4 / frequency 4] abba=c.

Step 2

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

Rewriting system is complete. See ⟨a, b | aabbaba=abab⟩.