Volume 13, January 2009
|Page(s)||328 - 342|
|Published online||21 July 2009|
On the number of word occurrences in a semi-Markov sequence of letters
University of Athens,
Department of Mathematics,
157 84 Athens, Greece; firstname.lastname@example.org; email@example.com
Revised: 27 September 2007
Revised: 6 March 2008
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.
Mathematics Subject Classification: 60K10 / 60K20 / 60C05 / 60E05
Key words: Discrete time semi-Markov / number of word occurrences
© EDP Sciences, SMAI, 2009
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.