%0 Generic
%D 2006
%T Classifying states of a finite Markov chains with Membrane Computing
%A Mónica Cardona
%A M. Angels Colomer
%A Mario J. Pérez-Jiménez
%A Alba Zaragoza
%C Amsterdam, The Netherlands
%I Springer
%P 266-278
%R 10.1007/11963516
%U http://www.springerlink.com/content/fnm78581p53366g8/?p=7483d1633ed448c2a8a9414d09ea1502&pi=16
%V 4361
%X 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.
%@ 978-3-540-69088-7