๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Periodicity and unbordered segments of words

โœ Scribed by Andrzej Ehrenfeucht; D.M. Silberger


Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
987 KB
Volume
26
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis


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.

Principal Theorem. Let (II be infinite. Then the left segment T of (Y, for which ITI= #(Y, is the shorfest for which (II=TTT---=T~.

Theorem. Let a be finite. Let a be the longest proper that (II = 07 (CK = w). ?%en T also is unbordered. unbordered left (right) segment of a. Let T be such Theorem. Let (II be finite and not of the form 0" for n > 1. Let L be a letter in the word ~1. Then there exist words p and v such that cy = pLv while the word Lvp is unbordered.


๐Ÿ“œ SIMILAR VOLUMES


Corrigendum to โ€œGeneralized periodicity
โœ Masami Ito; Gerhard Lischke ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 59 KB

## 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)

Toeplitz Words, Generalized Periodicity
โœ 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