Locating maximal approximate runs in a string

We also obtain results for the mean and variance of the number of overlapping occurrences of a word in a finite discrete time semi-Markov sequence of letters under certain

The convergence in probability is thus obtained thanks to (45) and (14).. We conclude in the general case and for the convergence in probability as in the proof of Theorem 4.2.

It will be seen that the method used in this paper leads immediately to a much better result than o (n/log2 n) for thenumber ofprimitive abundant numbers not

As already pointed out, the Parikh matrix mapping gives more information about a word than the classical Parikh mapping, although the Parikh matrix... mapping is still

‒ from all values of the non-embedding area. To implement the first option, it is necessary to pre-set the threshold for the frequency of occurrence of rounded absolute

The upper bound is achieved by analysis of Lyndon words (i.e. words that are primitive and minimal/maximal in the class of their cyclic equivalents) that appear as periods of cubic

As for the lower bound, we describe an infinite family of binary words that contain more than 0.41 n cubic runs (Section 5).. In particular, we improve both the lower and the

In general, repetitions are studied also from other points of view, like: the classification of words (both finite and infinite) not containing repetitions of a given