2006
DOI: 10.1007/11839132_7
|View full text |Cite
|
Sign up to set email alerts
|

Handling Markov Chains with Membrane Computing

Abstract: Summary. 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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2006
2006
2018
2018

Publication Types

Select...
3
1

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 5 publications
0
5
0
Order By: Relevance
“…A model based on Markov chains in order to model temperature and rainfall can be accepted. P systems modeling Markov chains were previously presented in [5] and they should be considered in order to improve some results.…”
Section: Discussionmentioning
confidence: 99%
“…A model based on Markov chains in order to model temperature and rainfall can be accepted. P systems modeling Markov chains were previously presented in [5] and they should be considered in order to improve some results.…”
Section: Discussionmentioning
confidence: 99%
“…Other remarkable Mario's contribution which is still a bud in the Membrane Computing tree is related to the link between P systems and Markov chains. In [10], the authors propose a first approach to the problem of computing the natural powers of the transition matrix of a finite and homogeneous Markov chain. Such computation allows to estimate its limit in the case that it is convergent, and therefore, to know the stationary distribution of the process.…”
Section: Other Areas Of Computer Sciencementioning
confidence: 99%
“…P systems (membrane computing) are nondeterministic theoretical computing devices, which are abstracted from the structure and functioning of living cells and from the interactions of living cells in tissues or higher order biological structures [25,26,29]. Due to the P system's powerful computing capability [21,27] and its similarity to evolutionary computation, several corresponding optimization algorithms have been proposed that were inspired by P systems [4,15,24,28].…”
Section: Algorithm Design Based On the Dynamic Multi-objective Optimimentioning
confidence: 99%