Maximal success durations for a semi-Markov process

DOI10.1016/0304-4149(87)90013-5zbMath0629.60099OpenAlexW1998081398MaRDI QIDQ1094005

Samuel Karlin, David E. Fousler

Publication date: 1987

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-4149(87)90013-5

zbMATH Keywords

semi-Markov processmaximum sojourn time

Mathematics Subject Classification ID

Markov renewal processes, semi-Markov processes (60K15)

Related Items (1)

Algorithms for the optimal identification of segment neighborhoods

Cites Work

• Unnamed Item
• Unnamed Item
• An Erdős-Rényi law with shifts
• An extreme value theory for long head runs
• Some limit results for longest common subsequences
• On a new law of large numbers
• A Contribution to Renewal Theory
• New approaches for computer analysis of nucleic acid sequences.
• Counts of long aligned word matches among random letter sequences
• Long repetitive patterns in random sequences
• On the Length of the Longest Head-Run for a Markov Chain with Two States
• Longest common subsequences of two random sequences
• Limit Distributions of Random Variables Associated with Long Duplications in a Sequence of Independent Trials
• Limit Distribution of Random Variables Associated with Multiple Long Duplications in a Sequence of Independent Trials

This page was built for publication: Maximal success durations for a semi-Markov process