Morphocompletion for #4850 ⟨a, b | ababbbba=bab⟩

Solved by morph:6/0. (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: arenaTotalLimit

#	Rule
1.	ababbbba ⇒ bab
2.	ababbbbbab ⇒ babbabbbba
3.	babbabbbbaabbbba ⇒ ababbbbbbab
4.	ababbbababbbbbbab ⇒ babbbabbbbaabbbba
5.	ababbbbbbabbabbbba ⇒ babbabbbbaabbbbbab
6.	babbbabbbbaabbbbaabbbba ⇒ ababbbababbbbbbbab
7.	babbabbbbaabbabbbbaabbbba ⇒ ababbbbbaababbbbbbab
8.	babbabbbbaabbbbbabbabbbba ⇒ ababbbbbbabbabbbbbab
	...

Collecting factors up to length 8 / frequency 7:

[2/0]	bb	64	`lf:64,rf:52`
[2/1]	ba	43	`lf:33,lp:4,ls:6,rf:26,rp:4,rs:2,lsrp:2`
[2/2]	ab	37	`lf:31,lp:4,ls:2,rf:28,rp:4,rs:6,lprs:2`
[2/3]	aa	6	`lf:6,rf:3,a:2`
[3/0]	bbb	40	`lf:40,rf:36`
[3/1]	bba	30	`lf:24,ls:6,rf:16,rs:2`
[3/2]	bab	27	`lf:21,lp:4,ls:2,rf:21,rp:4,rs:6,re:1,lsrp:2,lprs:4`
[3/3]	abb	24	`lf:24,rf:16`
[3/4]	aba	9	`lf:5,lp:4,rf:6,rp:4`
[3/5]	aab	6	`lf:6,rf:3,a:2`
[3/6]	baa	6	`lf:6,rf:3,a:2`
[4/0]	bbba	24	`lf:18,ls:6,rf:13,rs:2`
[4/1]	bbbb	22	`lf:22,rf:23`
[4/2]	babb	22	`lf:18,lp:4,rf:14,rp:3`
[4/3]	abbb	18	`lf:18,rf:13`
[4/4]	bbab	14	`lf:12,ls:2,rf:11,rs:5,a:1`
[4/5]	abab	9	`lf:5,lp:4,rf:6,rp:4`
[4/6]	aabb	6	`lf:6,rf:2,a:2`
[5/0]	bbbba	22	`lf:16,ls:6,rf:11,rs:2`
[5/1]	abbbb	16	`lf:16,rf:11`
[5/2]	babbb	14	`lf:13,lp:1,rf:11,rp:1`
[5/3]	bbabb	9	`lf:9,rf:5,a:1`
[5/4]	ababb	9	`lf:5,lp:4,rf:6,rp:4`
[5/5]	bbbab	8	`lf:6,ls:2,rf:8,rs:5,a:1`
[5/6]	babba	8	`lf:5,lp:3,rf:3,rp:2,a:1`
[6/0]	abbbba	18	`lf:12,ls:6,rf:4,rs:2`
[6/1]	babbbb	11	`lf:11,rf:9`
[6/2]	ababbb	9	`lf:5,lp:4,rf:6,rp:4`
[6/3]	babbab	8	`lf:5,lp:3,rf:3,rp:2,a:1`
[6/4]	bbabbb	7	`lf:7,rf:4,a:1`
[6/5]	bbbbab	6	`lf:4,ls:2,rf:6,rs:5,a:1`
[6/6]	abbabb	6	`lf:6,rf:3,a:1`
[7/0]	babbbba	11	`lf:8,ls:3,rf:3,rs:1`
[7/1]	babbabb	8	`lf:5,lp:3,rf:3,rp:2,a:1`
[7/2]	bbabbbb	7	`lf:7,rf:4,a:1`
[7/3]	ababbbb	7	`lf:4,lp:3,rf:5,rp:3`
[7/4]	aabbbba	7	`lf:4,ls:3,rf:1,rs:1,a:2`
[7/5]	bbbbbab	6	`lf:4,ls:2,rf:6,rs:5,a:1`
[7/6]	abbabbb	6	`lf:6,rf:3,a:1`

Considering [length 6 / frequency 0] abbbba=c.

Step 2

Auxiliary generators:
1. c = abbbba
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 | ababbbba=bab⟩.