Handling markov chains with membrane computing

Authors:
Mónica Cardona;M. Angels Colomer;Mario J. Pérez-Jiménez;Alba Zaragoza
Affiliations:
Department of Mathematics, University of Lleida, LLeida, Spain;Department of Mathematics, University of Lleida, LLeida, Spain;Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Sevilla, Spain;Department of Mathematics, University of Lleida, LLeida, Spain
Venue:
UC'06 Proceedings of the 5th international conference on Unconventional Computation
Year:
2006

Citing 3
Cited 3

Probability, stochastic processes, and queueing theory: the mathematics of computer performance modeling

Probability, stochastic processes, and queueing theory: the mathematics of computer performance modeling
Computing with membranes

Journal of Computer and System Sciences
Membrane Computing: An Introduction

Membrane Computing: An Introduction

Modeling Ecosystems Using P Systems: The Bearded Vulture, a Case Study

Membrane Computing
Dynamic multi-objective optimization based on membrane computing for control of time-varying unstable plants

Information Sciences: an International Journal
Classifying states of a finite markov chain with membrane computing

WMC'06 Proceedings of the 7th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

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.