Classifying states of a finite Markov chains with Membrane Computing

Thu, 11/29/2007 - 13:33 — ana

Title	Classifying states of a finite Markov chains with Membrane Computing
Publication Type	Journal Papers
Year of Publication	2006
Authors	Cardona, M., Colomer A. M., Pérez-Jiménez M. J., & Zaragoza A.
Journal Title	Lecture Notes in Computer Science
ISBN Number	978-3-540-69088-7
Publisher	Springer
Place Published	Amsterdam, The Netherlands
Volume	4361
Pages	266-278
Abstract	In this paper we present a method to classify the states of a finite Markov chain through membrane computing. A specific P system with external output is designed for each boolean matrix associated with a finite Markov chain. The computation of the system allows us to decide the convergence of the process because it determines in the environment the classification of the states (recurrent, absorbent, and transient) as well as the periods of states. The amount of resources required in the construction is polynomial in the number of states of the Markov chain.
URL	http://www.springerlink.com/content/fnm78581p53366g8/?p=7483d1633ed448c2a8a9414d09ea1502&pi=16
ISSN Number	0302-9743
DOI	10.1007/11963516

Research Group on Natural Computing