On Discrete Time Semi-Markov Chains and Applications in Words Occurrences

DOI10.1080/03610920701713328zbMath1167.60357OpenAlexW2109077599MaRDI QIDQ3634538

Margarita Karaliopoulou, Ourania Chryssaphinou, Nikolaos Limnios

Publication date: 25 June 2009

Published in: Communications in Statistics - Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03610920701713328

zbMATH Keywords

wordswaiting timefirst occurrencebackward recurrence timesdiscrete time semi-Markov process

Mathematics Subject Classification ID

Markov renewal processes, semi-Markov processes (60K15) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (12)

Conditional failure occurrence rates for semi-Markov chains ⋮ Insuring wind energy production ⋮ Filtering hidden semi-Markov chains ⋮ Application of hidden semi-Markov models for the seismic hazard assessment of the North and South Aegean Sea, Greece ⋮ Maximum likelihood estimation for general hidden semi-Markov processes with backward recurrence time dependence ⋮ Exact MLE and asymptotic properties for nonparametric semi-Markov models ⋮ Viterbi algorithms for Hidden semi-Markov Models with application to DNA Analysis ⋮ On the number of word occurrences in a semi-Markov sequence of letters ⋮ Estimation of the intensity of the hitting time for semi-Markov chains and hidden Markov renewal chains ⋮ Some Results on Modeling Biological Sequences and Web Navigation with a Semi Markov Chain ⋮ Asymptotic properties of words in semi-Markov sequences ⋮ Nonparametric Estimation of the Stationary Distribution of a Discrete-Time Semi-Markov Process

Cites Work

• Unnamed Item
• Unnamed Item
• String overlaps, pattern matching, and nontransitive games
• Waiting times for patterns in a sequence of multistate trials
• Markov renewal processes, counters and repeated sequences in Markov chains
• How many random digits are required until given sequences are obtained?
• Introduction to Matrix Analytic Methods in Stochastic Modeling
• Exact distribution of word occurrences in a random sequence of letters
• 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
• Limit Theorems for Markov Renewal Processes
• Markov Renewal Processes with Finitely Many States
• Markov renewal theory
• Markov Renewal Processes: Definitions and Preliminary Properties
• Semi-Markov processes and reliability

This page was built for publication: On Discrete Time Semi-Markov Chains and Applications in Words Occurrences