Abstract
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)−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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
