Classifying States of a Finite Markov Chain with Membrane Computing

DOI10.1007/11963516_17zbMATH Open1187.68230OpenAlexW1608028774MaRDI QIDQ3591015FDOQ3591015

Authors Mónica Cardona, M. Angels Colomer, Mario J. Pérez-Jiménez, Alba Zaragoza

Publication date 3 September 2007

Published in Membrane Computing (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.3008

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Handling Markov Chains with Membrane Computing
• A non-recursive algorithm for classifying the states of a finite Markov chain
• The classification of states for Markov chains in random environments
• scientific article; zbMATH DE number 1778386
• A framework for complexity classes in membrane computing
• Relevant states and memory in Markov chain bootstrapping and simulation
• AN APPROACH TO MEMBRANE COMPUTING UNDER INEXACTITUDE
• The classification and properties of states for Markov chains in random environments
• scientific article; zbMATH DE number 4147239
• State Classification and Multiclass Optimization of Continuous-Time and Continuous-State Markov Processes

Cited in

(3)

• A non-recursive algorithm for classifying the states of a finite Markov chain
• Handling Markov Chains with Membrane Computing
• Modeling Markov sources and hidden Markov models by P systems

This page was built for publication: Classifying States of a Finite Markov Chain with Membrane Computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3591015)