Handling Markov chains with membrane computing

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 semiuniform 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. © Springer-Vorlag Berlin Heidelberg 2006.