Abstract
We are concerned with introducing entropy in the field of countable discrete-time semi-Markov process theory. We define the entropy of the finite distributions of the semi-Markov chain and obtain explicitly its entropy rate by extending the Shannon–McMillan–Breiman theorem to this class of non-stationary discrete-time processes. We also define the relative entropy rate between two semi-Markov chains. We then develop some maximum entropy methods for these processes.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
