A new method to simulate restricted variants of polarizationless P systems with active membranes
From MaRDI portal
Publication:1983030
DOI10.1007/s41965-019-00024-zzbMath1469.68033OpenAlexW2991885863WikidataQ126670099 ScholiaQ126670099MaRDI QIDQ1983030
Publication date: 14 September 2021
Published in: Journal of Membrane Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s41965-019-00024-z
Related Items (7)
On the power of P systems with active membranes using weak non-elementary membrane division ⋮ A bibliometric analysis of membrane computing (1998--2019) ⋮ On the power of membrane dissolution in polarizationless P systems with active membranes ⋮ A characterisation of \textbf{P} by \textbf{DLOGTIME}-uniform families of polarizationless P systems using only dissolution rules ⋮ Evaluating space measures in P systems ⋮ Bounding the space in P systems with active membranes ⋮ Alternative space definitions for P systems with active membranes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The computational power of membrane systems under tight uniformity conditions
- Trading polarizations for labels in P systems with active membranes
- Membrane computing and complexity theory: A characterization of PSPACE
- Complexity classes in models of cellular computing with membranes
- The computational power of cell division in P systems: Beating down parallel computers?
- Solving a special case of the P conjecture using dependency graphs with dissolution
- Solving QSAT in sublinear depth
- Solving HPP and SAT by P systems with active membranes and separation rules
- Further remarks on \(P\) systems with active membranes, separation, merging, and release rules
- Complexity aspects of polarizationless membrane systems
- A Solution of Horn-SAT with P Systems Using Antimatter
- Remarks on the Computational Power of Some Restricted Variants of P Systems with Active Membranes
- Membrane Dissolution and Division in P
- Solving the ST-Connectivity Problem with Pure Membrane Computing Techniques
- Simulating Turing Machines with Polarizationless P Systems with Active Membranes
- Simulating Elementary Active Membranes
- A Characterisation of NL Using Membrane Systems without Charges and Dissolution
- Uniform Solution of QSAT Using Polarizationless Active Membranes
- A New Approach for Solving SAT by P Systems with Active Membranes
- Sublinear-Space P Systems with Active Membranes
- Membrane Computing
- Membrane Computing
- Solving SAT by P Systems with Active Membranes in Linear Time in the Number of Variables
- Active Membrane Systems Without Charges and Using Only Symmetric Elementary Division Characterise P
- Membrane Computing
This page was built for publication: A new method to simulate restricted variants of polarizationless P systems with active membranes
