The Shannon information on a Markov chain approximately normally distributed
Richard O'Neil (1990)
Colloquium Mathematicae
Similarity:
Richard O'Neil (1990)
Colloquium Mathematicae
Similarity:
Margarita Karaliopoulou (2009)
ESAIM: Probability and Statistics
Similarity:
Let a finite alphabet . We consider a sequence of letters from generated by a discrete time semi-Markov process We derive the probability of a word occurrence in the sequence. 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 conditions.
Brian Marcus, Selim Tuncel (1990)
Inventiones mathematicae
Similarity:
Ebeling, Werner, Rateischak, Katja (1998)
Discrete Dynamics in Nature and Society
Similarity:
Amy Glen, Jacques Justin (2009)
RAIRO - Theoretical Informatics and Applications
Similarity:
In this paper, we survey the rich theory of infinite which generalize to any finite alphabet, in a rather resembling way, the well-known family of on two letters. After recalling definitions and basic properties, we consider that allow for a deeper study of these words. Some properties of factors are described, including factor complexity, palindromes, fractional powers, frequencies, and return words. We also consider lexicographical properties of episturmian words, as well as their...