1. Home page
  2. Search

On the number of word occurrences in a semi-markov sequence of letters

This item is provided by the institution :
/aggregator-openarchives/portal/institutions/uoa   

Repository :
Pergamos Digital Library   

see the original item page
in the repository's web site and access all digital files if the item*



On the number of word occurrences in a semi-markov sequence of letters
Karaliopoulou, M.
scientific_publication_article
Επιστημονική δημοσίευση - Άρθρο Περιοδικού (EL)
Scientific publication - Journal Article (EN)
2009
Let a finite alphabet Ω. We consider a sequence of letters from Ω generated by a discrete time semi-Markov process (Zγ; γ ϵ N). 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. © EDP Sciences, SMAI 2009. (EN)
English
Ερευνητικό υλικό ΕΚΠΑ
https://creativecommons.org/licenses/by-nc/4.0/
University of Athens
Pergamos Digital Library
Journal Article



*Institutions are responsible for keeping their URLs functional (digital file, item page in repository site)