Monodirectional P systems
From MaRDI portal
Publication:2311264
DOI10.1007/s11047-016-9565-2zbMath1415.68092OpenAlexW2482914130WikidataQ57518240 ScholiaQ57518240MaRDI QIDQ2311264
Antonio E. Porreca, Alberto Leporati, Claudio Zandron, Luca Manzoni, Giancarlo Mauri
Publication date: 10 July 2019
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://idus.us.es/xmlui/handle/11441/33106
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Related Items (13)
On the power of P systems with active membranes using weak non-elementary membrane division ⋮ Rule synchronization for monodirectional tissue-like P systems with channel states ⋮ The counting power of P systems with antimatter ⋮ Active P-colonies ⋮ Spiking neural P systems with polarizations and rules on synapses ⋮ Bounding the space in P systems with active membranes ⋮ Simulating counting oracles with cooperation ⋮ Shallow laconic P-systems can count ⋮ Subroutines in P systems and closure properties of their complexity classes ⋮ Characterizing PSPACE with shallow non-confluent P systems ⋮ The computational power of monodirectional tissue P systems with symport rules ⋮ Monodirectional tissue P systems with channel states ⋮ Depth-two P systems can simulate Turing machines with \textbf{NP} oracles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The computational power of membrane systems under tight uniformity conditions
- The complexity of optimization problems
- Membrane Division, Oracles, and the Counting Hierarchy
- Computational efficiency of dissolution rules in membrane systems
- Simulating Elementary Active Membranes
- Active Membrane Systems Without Charges and Using Only Symmetric Elementary Division Characterise P
This page was built for publication: Monodirectional P systems