The detection of words and an ordering for Markov chains
From MaRDI portal
Publication:3147827
DOI10.1239/JAP/1085496592zbMath1032.60066OpenAlexW2021013069MaRDI QIDQ3147827
Publication date: 7 March 2004
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1239/jap/1085496592
Permutations, words, matrices (05A05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Related Items (7)
Level Crossing Ordering of Skip-Free-to-the-Right Continuous-Time Markov Chains ⋮ Comparison of level-crossing times for Markov and semi-Markov processes ⋮ Some sufficient conditions for stochastic comparisons between hitting times for skip-free Markov chains ⋮ Usual and stochastic tail orders between hitting times for two Markov chains ⋮ Stochastic ordering for birth–death processes with killing ⋮ Stochastic ordering for continuous-time processes ⋮ Level-crossing ordering of semi-Markov processes and markov chains
This page was built for publication: The detection of words and an ordering for Markov chains