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

DOI10.1051/ps:2008009zbMath1181.60130OpenAlexW2137096889MaRDI QIDQ5851025

Margarita Karaliopoulou

Publication date: 21 January 2010

Published in: ESAIM: Probability and Statistics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/104426

zbMATH Keywords

discrete time semi-Markovnumber of word occurrences

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Combinatorial probability (60C05) Applications of renewal theory (reliability, demand theory, etc.) (60K10) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (2)

Step semi-Markov models and application to manpower management ⋮ Asymptotic properties of words in semi-Markov sequences

Cites Work

• String overlaps, pattern matching, and nontransitive games
• On Discrete Time Semi-Markov Chains and Applications in Words Occurrences
• On some waiting time problems
• The intersite distances between pattern occurrences in strings generated by general discrete- and continuous-time models: an algorithmic approach
• Discrete-Time Semi-Markov Model for Reliability and Survival Analysis
• Unnamed Item

This page was built for publication: On the number of word occurrences in a semi-Markov sequence of letters