Abstract
Let $A,D$ be words over some alphabet. $D$ has position $p$ in the cyclic word $A$ if the cyclic permutation of $A$ which begins with the $p$th letter of $A$ has an initial subword equal to $D$. It is proved that every nonperiodic word $A$ of length $> 1$ has a cyclic permutation which is a product BC for some nonempty subwords $B,C$ having unique positions in the cyclic word $A$.
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 callSimilar Papers
Disclaimer: 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.
