Abstract
Classification of the state space of finite-dimensional Markov chains (discrete time parameter) is considered using classical algebraic techniques and Boolean algebraic methods.
The validity of using Boolean methods is shown. Computational procedures for such classification using both the methods are illustrated by some examples and compared.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hammer, P. L. and Rudeanu, S. Boolean Methods in Operations Research, Springer-Verlag, Heidelberg, New York.
Derman, C. Unpublished Lecture Notes on Stochastic Processes, Columbia University, 1968.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1969 Springer-Verlag
About this paper
Cite this paper
Barahamihir, M., Behara, D. (1969). Boolean algebraic methods in Markov chains. In: Behara, M., Krickeberg, K., Wolfowitz, J. (eds) Probability and Information Theory. Lecture Notes in Mathematics, vol 89. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0079116
Download citation
DOI: https://doi.org/10.1007/BFb0079116
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-04608-0
Online ISBN: 978-3-540-36098-8
eBook Packages: Springer Book Archive