Asynchronous P systems with active membranes

DOI10.1016/j.tcs.2011.12.026zbMath1277.68076OpenAlexW2020796987MaRDI QIDQ418762

Alberto Leporati, Pierluigi Frisco, Gordon Govan

Publication date: 30 May 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.12.026

zbMATH Keywords

NP-completeasynchronous modeactive membranesasynchronous P systemsMAJORITY-SATPP-completerecognising P systems

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Neighbourhood message passing computation on a lattice with cP systems ⋮ The computational power of monodirectional tissue P systems with symport rules ⋮ Monodirectional tissue P systems with channel states ⋮ Cell-like P systems with polarizations and minimal rules ⋮ A uniform solution to SAT problem by symport/antiport P systems with channel states and membrane division

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The computational power of membrane systems under tight uniformity conditions
• P systems with minimal parallelism
• Complexity classes in models of cellular computing with membranes
• Computing with membranes
• Membrane computing. An introduction.
• The conformon-P system: a molecular and cell biology-inspired computability model
• P Systems with Active Membranes Operating under Minimal Parallelism
• P Systems with Elementary Active Membranes: Beyond NP and coNP
• Computing with Cells
• Recent complexity-theoretic results on P systems with active membranes
• A Formal Framework for Static (Tissue) P Systems