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