✦ LIBER ✦

Periodic-like words, periodicity, and boxes

✍ Scribed by Arturo Carpi; Aldo de Luca

Publisher: Springer-Verlag
Year: 2001
Tongue: English
Weight: 158 KB
Volume: 37
Category: Article
ISSN: 0001-5903
DOI: 10.1007/pl00013314

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Periods and Binary Words

✍ Vesa Halava; Tero Harju; Lucian Ilie 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 102 KB

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 peri

Toeplitz Words, Generalized Periodicity

Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms

✍ Julien Cassaigne; Juhani Karhumäki 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 309 KB

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

Locally Periodic Versus Globally Periodi

Locally Periodic Versus Globally Periodic Infinite Words

✍ J. Karhumäki; A. Lepistö; W. Plandowski 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 164 KB

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

Words, univalent factors, and boxes

✍ Arturo Carpi; Aldo de Luca; Stefano Varricchio 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 194 KB

Generalized periodicity and primitivity

Generalized periodicity and primitivity for words

✍ Masami Ito; Gerhard Lischke 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 225 KB

Periodicity and unbordered segments of w

Periodicity and unbordered segments of words

✍ Andrzej Ehrenfeucht; D.M. Silberger 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 987 KB

A nonempty word 0 is said to be a border of a word ar if and only if (Y = hp = @p for some nonempty words A and p. For an arbitrary (possibly infinite) sequence (II the expression #cu denotes the (possibly infinite) supremum of the set of all Ipj for /3 an u&ordered finite segment of (Y. ## Princip