Results 1 
4 of
4
The Number of Runs in a Ternary Word
 in "Prague Stringology Conference 2010 (PSC 2010
"... Abstract. It is not known that the maximum number of runs in a word of length n is attained by a binary word though it seems likely that this is the case. In this note, we report observations on runs in ternary words, in which every small factor contains all three letters. 1 ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
(Show Context)
Abstract. It is not known that the maximum number of runs in a word of length n is attained by a binary word though it seems likely that this is the case. In this note, we report observations on runs in ternary words, in which every small factor contains all three letters. 1
Average Number of Runs and Squares in Necklace
"... Abstract. A repetition is an important property of a string. In this paper we consider the average number of occurrences of primitively rooted repetitions in necklace. First, we define circular square and circular run for a string and show the average number of them. Using these results, we obtain t ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. A repetition is an important property of a string. In this paper we consider the average number of occurrences of primitively rooted repetitions in necklace. First, we define circular square and circular run for a string and show the average number of them. Using these results, we obtain the average number of squares, the average number of runs and the average sum of exponents of runs in a necklace, exactly.