Abstract
In this paper we approach the problem of computing the n–th power of the transition matrix of an arbitrary Markov chain through membrane computing. The proposed solution is described in a semi–uniform way in the framework of P systems with external output. The amount of resources required in the construction is polynomial in the number of states of the Markov chain and in the power. The time of execution is linear in the power and is independent of the number of states involved in the Markov chain.
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
Cardona, M., Colomer, M.A., Conde, J., Miret, J.M., Miró, J., Zaragoza, A.: Markov chains: computing limit existence and approximations with DNA. Biosystems 81(3), 261–266 (2005)
Häggström, O.: Finite Markov chains and algorithmic applications, London Mathematical Society. Cambridge University Press, Cambridge (2002)
Nelson, R.: Probability, stochastic processes, and queueing theory: the mathematics of computer performance modeling. Springer, New York (1995)
Păun, Gh.: Computing with membranes, Journal of Computer and System Sciences, 61(1), 108–143 (2000); Turku Center for Computer Science-TUCS Report Nr. 208 (1998)
Păun, Gh.: Membrane Computing. An Introduction. Springer, Berlin (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cardona, M., Colomer, M.A., Pérez-Jiménez, M.J., Zaragoza, A. (2006). Handling Markov Chains with Membrane Computing. In: Calude, C.S., Dinneen, M.J., Păun, G., Rozenberg, G., Stepney, S. (eds) Unconventional Computation. UC 2006. Lecture Notes in Computer Science, vol 4135. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11839132_7
Download citation
DOI: https://doi.org/10.1007/11839132_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38593-6
Online ISBN: 978-3-540-38594-3
eBook Packages: Computer ScienceComputer Science (R0)