We consider so-called Toeplitz words which can be viewed as generalizations of one-way infinite periodic words . We compute their subword complexity , and show that they can always be generated by iterating periodically a finite number of morphisms . Moreover , we define a structural classification
Periods and Binary Words
✍ Scribed by Vesa Halava; Tero Harju; Lucian Ilie
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 102 KB
- Volume
- 89
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
✦ Synopsis
We give an elementary short proof for a well known theorem of Guibas and Odlyzko stating that the sets of periods of words are independent of the alphabet size. As a consequence of our constructive proof, we obtain a linear time algorithm which, given a word, computes a binary one with the same periods. We give also a very short proof for the famous Fine Wilf periodicity lemma.
📜 SIMILAR VOLUMES
We call a one-way infinite word w over a finite alphabet ðr; lÞ-repetitive if all long enough prefixes of w contain as a suffix a rth power (or more generally a repetition of order r) of a word of length at most l: We show that each ð2; 4Þrepetitive word is ultimately periodic, as well as that there
Problems with carry-over effects in the simple two-period crowover have lead to interest in more complex crow-over designs. A method for analping the optimum two-treatment three-period design with binaryresponse variables is given by making a simple extension to Gart's logistic model.The method give
Photometric observations of 1999 HF 1 reveal that its lightcurve has two components of low amplitudes (0.10-0.12 mag) and different periods (2.3191 and 14.02 h). It is likely another binary near-Earth asteroid; its lower limit on the secondary-to-primarydiameter ratio is ≈0.2, the radius of the mutu
## Abstract We correct a mistake in the paper “Generalized periodicity and primitivity for words” [4] and justify the existence of regular languages all of whose roots are not even context‐sensitive. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)