Enhanced mobile membranes: computability results
From MaRDI portal
Publication:537912
DOI10.1007/s00224-010-9256-9zbMath1217.68093WikidataQ57936738 ScholiaQ57936738MaRDI QIDQ537912
Shankara Narayanan Krishna, Gabriel Ciobanu
Publication date: 23 May 2011
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-010-9256-9
Lindenmayer systems; computational power; matrix grammars; register machines; mobile membranes; Parikh vectors
Related Items
A $\Sigma_2^P \cup \Pi_2^P$ Lower Bound Using Mobile Membranes, Solving SAT with P systems with anti-membranes, Relating randomized right-hand sides to communicating rewriting rules, Modelling and verification of weighted spiking neural systems, Properties of enhanced mobile membranes via coloured Petri nets, Solving a weak NP-complete problem in polynomial time by using mutual mobile membrane systems, Computing by Endocytosis and Exocytosis, Computational Power of Protein Networks
Cites Work