Abstract

A word of length n over an alphabet A is a sequence a 1 … a n of letters of A. It is convenient to consider a “long enough” word over A as an infinite right word, that is an infinite sequence a 1 … a i … of elements of A. An integer λ is a period of the word in the interval [ j … k] if we have a i = a i+ λ for those indices i and i + λ in the considered interval. The period of a word designates its smallest period over its whole length. A point p of a word is the cut ( a 1 … a p , a p+1 …). A non-negative integer λ is a local period at point p iff λ is a period in the interval [ p − λ + 1 … p + λ]. According to the critical point's theorem [1,2], the period of a “long enough (or not)” word is the maximum of the minimal local periods taken in each point of this word. M.P. Schützenberger, who was at the origin of the research work on the relations between local periods and periods of a word obtained by concatenation of periodical words, and our ability to characterize its period from the observation of the local period at the concatenation points only. This is the formulation of the unpublished answer we offered him that we suggest here.

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 call

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.