A fixing block in an irreducible word is a square, segment of the form XX, and the period is the length of X. An occurrence of a block C in an irr~ucfole word, W = XCY, is called a chain if XA having an infinite/rreducible extension implies A is an initial segment of C. The length of such a chain is
On repetitions of blocks in binary sequences
β Scribed by F.M Dekking
- Publisher
- Elsevier Science
- Year
- 1976
- Tongue
- English
- Weight
- 448 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper, we consider the problem of expressing a term of a given nondegenerate binary recurrence sequence as a sum of factorials. We show that if one bounds the number of factorials allowed, then there are only finitely many effectively computable terms which can be represented in this way. As
A simple method of computing the number of 1's in the binary sequences obtained from combination generators has been developed. The procedure, which is based exclusively on the particular form of the combining function, can be applied to standard generators proposed and published in the open literat
## Demethylation of a repetitive DNA sequence in human cancers To detect DNA alterations in unknown regions in human cancers, we have performed restriction landmark genomic scanning (RLG S) analysis of DNA isolated from cancer and normal cells. One spot with a highly intensified signal was detecte