On the power of membrane dissolution in polarizationless P systems with active membranes

DOI10.1007/S11047-022-09926-XMaRDI QIDQ6136468zbMATH OpenOpenAlexFDO

Authors Zsolt Gazdag, Károly Hajagos

Publication date 31 August 2023

Published in Natural Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11047-022-09926-x

zbMATH Keywords

membrane computingreachability problemactive membranesNL-completenessdissolution rules

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Recommendations

• Membrane Computing
• Computational efficiency of dissolution rules in membrane systems
• Complexity aspects of polarizationless membrane systems
• Polarizationless P systems with active membranes: computational complexity aspects
• Polarizationless P Systems with Active Membranes Working in the Minimally Parallel Mode

Cites work

• scientific article; zbMATH DE number 1583885 (Why is no real title available?)
• scientific article; zbMATH DE number 5671765 (Why is no real title available?)
• scientific article; zbMATH DE number 2118901 (Why is no real title available?)
• scientific article; zbMATH DE number 7298595 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• A Characterisation of NL Using Membrane Systems without Charges and Dissolution
• A new method to simulate restricted variants of polarizationless P systems with active membranes
• A polynomial complexity class in P systems using membrane division
• Active Membrane Systems Without Charges and Using Only Symmetric Elementary Division Characterise P
• Membrane Computing
• Membrane Dissolution and Division in P
• Membrane computing and complexity theory: A characterization of PSPACE
• On the power of P systems with active membranes using weak non-elementary membrane division
• P systems attacking hard problems beyond NP: a survey
• P systems with active membranes: Attacking NP-complete problems
• Seeking computational efficiency boundaries: the Păun's conjecture
• Simulating elementary active membranes
• Solving a special case of the P conjecture using dependency graphs with dissolution
• Solving the ST-connectivity problem with pure membrane computing techniques
• Space-bounded reducibility among combinatorial problems
• The computational power of cell division in P systems: Beating down parallel computers?
• Uniform Solution of QSAT Using Polarizationless Active Membranes
• Uniformity is Weaker than Semi-Uniformity for Some Membrane Systems

Cited in

(4)

• A general neural membrane computing model
• Trading polarizations for labels in P systems with active membranes
• A Characterisation of NL Using Membrane Systems without Charges and Dissolution
• Active Membrane Systems Without Charges and Using Only Symmetric Elementary Division Characterise P

This page was built for publication: On the power of membrane dissolution in polarizationless P systems with active membranes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6136468)