Theoretical Computer Science
Hi-index | 0.00 |
We prove that if X is a finite prefix set and w is a non-periodic bi-infinite word possessing 3 disjoint X-factorizations, then the combinatorial rank of X is at most card(X) \Gamma 2. This is one of the rare cases when a cumulative defect effect is known to hold. Finally, connections to the critical factorization theorem are discussed.