Formal languages
Journal of Computer and System Sciences
Handbook of Formal Languages
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Formalizing spherical membrane structures and membrane proteins populations
WMC'06 Proceedings of the 7th international conference on Membrane Computing
On the computational power of brane calculi
Transactions on Computational Systems Biology VI
WMC'04 Proceedings of the 5th international conference on Membrane Computing
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
A molecular solution to the hitting-set problem in DNA-based supercomputing
Information Sciences: an International Journal
An overview of membrane computing
ICDCIT'11 Proceedings of the 7th international conference on Distributed computing and internet technology
Mutual mobile membranes with objects on surface
Natural Computing: an international journal
Simulation techniques for the calculus of wrapped compartments
Theoretical Computer Science
Hi-index | 5.23 |
Membrane computing is a biologically inspired computational paradigm. Motivated by brane calculi we investigate membrane systems which differ from conventional membrane systems by the following features: (1) biomolecules (proteins) can move through the regions of the systems, and can attach onto (and de-attach from) membranes, and (2) membranes can evolve depending on the attached molecules. The evolution of membranes is performed by using rules that are motivated by the operation of pinocytosis (the pino rule) and the operation of cellular dripping (the drip rule) that take place in living cells. We show that such membrane systems are computationally universal. We also show that if only the second feature is used then one can generate at least the family of Parikh images of the languages generated by programmed grammars without appearance checking (which contains non-semilinear sets of vectors). If, moreover, the use of pino/drip rules is non-cooperative (i.e., not dependent on the proteins attached to membranes), then one generates a family of sets of vectors that is strictly included in the family of semilinear sets of vectors. We also consider a number of decision problems concerning reachability of configurations and boundness.